Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288507
Yang Wang, Wenzhan Song, Weizhao Wang, Xiangyang Li, T. Dahlberg
In this paper, we address the problem of energy efficient localized routing in wireless ad hoc networks. Numerous energy aware routing protocols were proposed to seek the power efficiency of routes. Among them, several geographical localized routing protocols were proposed to help making smarter routing decision using only local information and reduce the routing overhead. However, most of the proposed localized routing methods cannot theoretically guarantee the power efficiency of their routes. In this paper, we give the first localized routing algorithm, called localized energy aware restricted neighborhood routing (LEARN), which can guarantee the power efficiency of its route asymptotically almost sure. Given destination node t, an intermediate node v will only select a certain neighbor v such that < vut les alpha for a parameter alpha < pi/3 in our LEARN method. We theoretically prove that for a network, formed by nodes that are produced by a Poisson distribution with rate n over a compact and convex region O with unit area, when the transmission range rn = radicbetalnl/pin for some beta > pi/alpha, our LEARN routing protocol will find the route for any pair of nodes asymptotically almost sure. When the transmission range rn = radicbetalnl/pin for some beta < pi/alpha, the LEARN routing protocol will not be able to find the route for any pair of nodes asymptotically almost sure. We also conducted simulations to study the performance of LEARN and compare it with a typical localized routing protocol (GPSR) and a global ad hoc routing protocol (DSR)
{"title":"LEARN: localized energy aware restricted neighborhood routing for ad hoc networks","authors":"Yang Wang, Wenzhan Song, Weizhao Wang, Xiangyang Li, T. Dahlberg","doi":"10.1109/SAHCN.2006.288507","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288507","url":null,"abstract":"In this paper, we address the problem of energy efficient localized routing in wireless ad hoc networks. Numerous energy aware routing protocols were proposed to seek the power efficiency of routes. Among them, several geographical localized routing protocols were proposed to help making smarter routing decision using only local information and reduce the routing overhead. However, most of the proposed localized routing methods cannot theoretically guarantee the power efficiency of their routes. In this paper, we give the first localized routing algorithm, called localized energy aware restricted neighborhood routing (LEARN), which can guarantee the power efficiency of its route asymptotically almost sure. Given destination node t, an intermediate node v will only select a certain neighbor v such that < vut les alpha for a parameter alpha < pi/3 in our LEARN method. We theoretically prove that for a network, formed by nodes that are produced by a Poisson distribution with rate n over a compact and convex region O with unit area, when the transmission range rn = radicbetalnl/pin for some beta > pi/alpha, our LEARN routing protocol will find the route for any pair of nodes asymptotically almost sure. When the transmission range rn = radicbetalnl/pin for some beta < pi/alpha, the LEARN routing protocol will not be able to find the route for any pair of nodes asymptotically almost sure. We also conducted simulations to study the performance of LEARN and compare it with a typical localized routing protocol (GPSR) and a global ad hoc routing protocol (DSR)","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"70 1","pages":"508-517"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85048775","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.288525
G. Ferrari, M. Martalò
In this paper, we analyze the lifetime of clustered sensor networks with decentralized binary detection under a physical layer quality of service (QoS) constraint, given by the maximum tolerable probability of decision error at the access point (AP). In order to properly model the network behavior, we consider four different distributions (exponential, uniform, Rayleigh, and lognormal) for the single sensors' lifetime. We show the benefits, in terms of longer network lifetime, of adaptive reclustering. On the other hand, absence of reclustering leads to a shorter network lifetime, and we show the impact of various clustering configurations under different QoS conditions. Our results show that the organization of sensors in a few big clusters is the winning strategy to maximize the network lifetime
{"title":"Sensor Networks with Decentralized Binary Detection: Clustering and Lifetime","authors":"G. Ferrari, M. Martalò","doi":"10.1109/SAHCN.2006.288525","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288525","url":null,"abstract":"In this paper, we analyze the lifetime of clustered sensor networks with decentralized binary detection under a physical layer quality of service (QoS) constraint, given by the maximum tolerable probability of decision error at the access point (AP). In order to properly model the network behavior, we consider four different distributions (exponential, uniform, Rayleigh, and lognormal) for the single sensors' lifetime. We show the benefits, in terms of longer network lifetime, of adaptive reclustering. On the other hand, absence of reclustering leads to a shorter network lifetime, and we show the impact of various clustering configurations under different QoS conditions. Our results show that the organization of sensors in a few big clusters is the winning strategy to maximize the network lifetime","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"27 1","pages":"645-650"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88160426","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.288581
A. Zabian
Power saving is an important issue in ad-hoc wireless networks, where no centralized communication is issued. Each node works as router to the others to allow the network connectivity. So, each node consumes parts of its energy in a forwarding others packets. In this paper we propose a self adjustment power saving mechanism for routing in ad-hoc wireless networks that results in significant power saving for all the network. Our mechanism is based on TDA (topology discovering algorithm) in which each node knows who are the active nodes in a fraction of the network. By determined simulation experiments, our simulation results show that in a topology like that constructed by TDA, the power consumption in routing is independent on the network size and is related only to the height of the tree built by the algorithm and to the packet size
{"title":"Topology Discovering Mechanism for Power Saving in Ad-hoc Wireless Networks","authors":"A. Zabian","doi":"10.1109/SAHCN.2006.288581","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288581","url":null,"abstract":"Power saving is an important issue in ad-hoc wireless networks, where no centralized communication is issued. Each node works as router to the others to allow the network connectivity. So, each node consumes parts of its energy in a forwarding others packets. In this paper we propose a self adjustment power saving mechanism for routing in ad-hoc wireless networks that results in significant power saving for all the network. Our mechanism is based on TDA (topology discovering algorithm) in which each node knows who are the active nodes in a fraction of the network. By determined simulation experiments, our simulation results show that in a topology like that constructed by TDA, the power consumption in routing is independent on the network size and is related only to the height of the tree built by the algorithm and to the packet size","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"33 1","pages":"910-915"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78809290","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.288499
Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young
Our objective in this paper is to design topology control algorithms such that (i) nodes have low degree and (ii) paths in the network have few hops. Low node degree is desirable in networks equipped with smart antennas and to reduce access contention. Short paths are desirable for minimizing communication delays and for better robustness to channel impairments and to mobility. Given any arbitrary unit-disc graph G representing all feasible links, our algorithms find a sparse subgraph G' having a maximum node degree of six and, for each pair of vertices u, v, having hopsG'(u, v) = O(hopsG(u,v) + logDelta), where Delta is the maximum node degree in G and hops G(u, v) denotes the shortest path length from u to v in G. This result is near-optimal: (i) there is a connected UDG G in which no connected subgraph has degree less than five, and (ii) for any graph G, any bounded-degree subgraph G' must have hopsG'(u, v) = Omega(hopsG(u, v) + logDelta) for some u, v. Our distributed algorithm scales, preserves link symmetry, does not need node synchronization, and requires only O(n) messages. We perform extensive simulations that quantify the performance of our algorithm in realistic scenarios
{"title":"Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks","authors":"Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young","doi":"10.1109/SAHCN.2006.288499","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288499","url":null,"abstract":"Our objective in this paper is to design topology control algorithms such that (i) nodes have low degree and (ii) paths in the network have few hops. Low node degree is desirable in networks equipped with smart antennas and to reduce access contention. Short paths are desirable for minimizing communication delays and for better robustness to channel impairments and to mobility. Given any arbitrary unit-disc graph G representing all feasible links, our algorithms find a sparse subgraph G' having a maximum node degree of six and, for each pair of vertices u, v, having hopsG'(u, v) = O(hopsG(u,v) + logDelta), where Delta is the maximum node degree in G and hops G(u, v) denotes the shortest path length from u to v in G. This result is near-optimal: (i) there is a connected UDG G in which no connected subgraph has degree less than five, and (ii) for any graph G, any bounded-degree subgraph G' must have hopsG'(u, v) = Omega(hopsG(u, v) + logDelta) for some u, v. Our distributed algorithm scales, preserves link symmetry, does not need node synchronization, and requires only O(n) messages. We perform extensive simulations that quantify the performance of our algorithm in realistic scenarios","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"30 1","pages":"431-439"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82811246","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.288565
Chaorong Peng, Chang Wen Chen
Dynamic hybrid multi routing protocol (DHMRP) is proposed to overcome re-discovered route path to be reply path in traditional routing protocol. The protocol utilizes the reply path based on the hybrid clustering hierarchical establishment of multi routing path to gain an automatic monitoring and repairing broken links in ad hoc networks. And due to reply path and multi routing path shall exist separately in network to gain mitigation traffic "bottlenecks" of ClusterHeads so that improving clusters stability. Performance comparison of DHMRP with AOMDV using Glomosim simulation shows that DHMRP is able to achieve a lower data delay and route discovery ratio and higher packets deliver ratio
{"title":"Dynamic Hybrid Multi Routing Protocol For Ad Hoc Wireless Network","authors":"Chaorong Peng, Chang Wen Chen","doi":"10.1109/SAHCN.2006.288565","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288565","url":null,"abstract":"Dynamic hybrid multi routing protocol (DHMRP) is proposed to overcome re-discovered route path to be reply path in traditional routing protocol. The protocol utilizes the reply path based on the hybrid clustering hierarchical establishment of multi routing path to gain an automatic monitoring and repairing broken links in ad hoc networks. And due to reply path and multi routing path shall exist separately in network to gain mitigation traffic \"bottlenecks\" of ClusterHeads so that improving clusters stability. Performance comparison of DHMRP with AOMDV using Glomosim simulation shows that DHMRP is able to achieve a lower data delay and route discovery ratio and higher packets deliver ratio","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"580 1","pages":"809-816"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85316234","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.288555
T. Scherer, T. Engel
The contribution of this work is to examine the performance of WMNs concerning bandwidth. Here, we provide a lower bound for bandwidth utilization in mesh networks. We analyze how much bandwidth may be provided to all mesh nodes if they communicate over one wireless communication channel and use the same gateway to the Internet. Even in such a scenario where devices compete on the access to the wireless channel it is possible to operate without bandwidth loss and share this bandwidth uniformly over the set of mesh nodes. This is achievable by optimizing spatial reuse. Here, this is achieved by scheduling channel access using time slots. Of course, this is not possible for every network topology. We measure the fraction of topologies that may operate with a uniformly shared maximum bandwidth
{"title":"Bandwidth Consumption for Providing Fair Internet Access in Wireless Mesh Networks","authors":"T. Scherer, T. Engel","doi":"10.1109/SAHCN.2006.288555","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288555","url":null,"abstract":"The contribution of this work is to examine the performance of WMNs concerning bandwidth. Here, we provide a lower bound for bandwidth utilization in mesh networks. We analyze how much bandwidth may be provided to all mesh nodes if they communicate over one wireless communication channel and use the same gateway to the Internet. Even in such a scenario where devices compete on the access to the wireless channel it is possible to operate without bandwidth loss and share this bandwidth uniformly over the set of mesh nodes. This is achievable by optimizing spatial reuse. Here, this is achieved by scheduling channel access using time slots. Of course, this is not possible for every network topology. We measure the fraction of topologies that may operate with a uniformly shared maximum bandwidth","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"75 1","pages":"746-750"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81351335","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.288425
Xingkai Bao, Jing Li
We consider multi-hop transmission from the source to the destination in ad-hoc wireless networks. Cooperative forwarding approaches in the framework of progressive network coding are proposed which generalize coded cooperation in a multi-hop context. In this framework, the source node and each succeeding relay node progressively decode what they receive from the previous stages and re-encode the messages to different parts of the parity bits from a single (network) codeword hop by hop. The maximal achievable rates for the multi-hop wireless networks using traditional repetition-forward and progressive network coding are analyzed with respect to different transmit power constraint and packet length allocation. The optimal number of relays are derived in each scheme. It is found that progressive network coding with adaptive packet length significantly increases the system throughput and improves the energy efficiency
{"title":"Progressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks","authors":"Xingkai Bao, Jing Li","doi":"10.1109/SAHCN.2006.288425","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288425","url":null,"abstract":"We consider multi-hop transmission from the source to the destination in ad-hoc wireless networks. Cooperative forwarding approaches in the framework of progressive network coding are proposed which generalize coded cooperation in a multi-hop context. In this framework, the source node and each succeeding relay node progressively decode what they receive from the previous stages and re-encode the messages to different parts of the parity bits from a single (network) codeword hop by hop. The maximal achievable rates for the multi-hop wireless networks using traditional repetition-forward and progressive network coding are analyzed with respect to different transmit power constraint and packet length allocation. The optimal number of relays are derived in each scheme. It is found that progressive network coding with adaptive packet length significantly increases the system throughput and improves the energy efficiency","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"462 1","pages":"207-215"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88386854","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.288511
Yui-Wah Lee, E. P. Stuntebeck, Scott C. Miller
A traditional approach to indoor tracking utilizes non-RF ranging techniques, such as infrared or ultrasound. The problem with these non-RF ranging techniques is that they do not work well when the tracking devices are buried in users' wallets or bags. As a result, there has been considerable interest in using only RF techniques for indoor tracking. Existing RF-only techniques, however, typically require a costly site survey and a floor-plan. In this paper, we present the MERIT system that we designed, implemented, and evaluated. MERIT is significantly different from existing systems in that it is pure RF-based yet it does not require a site survey nor a floor-plan. MERIT tracks users to a room granularity, and it can disambiguate neighboring rooms. This disambiguation is challenging because RF signals can traverse through walls. Also, because of indoor multipath interference, it is difficult to correlate signal strength with distance. In this work, we proposed two techniques for accurate disambiguation: spatial diversity and RF reflector. In our evaluation MERIT achieved an accuracy of 98.9%. MERIT was first conceived for a telecommunication application - intelligent telephone call routing, but it can also be used for other location-aware services
{"title":"MERIT: MEsh of RF sensors for Indoor Tracking","authors":"Yui-Wah Lee, E. P. Stuntebeck, Scott C. Miller","doi":"10.1109/SAHCN.2006.288511","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288511","url":null,"abstract":"A traditional approach to indoor tracking utilizes non-RF ranging techniques, such as infrared or ultrasound. The problem with these non-RF ranging techniques is that they do not work well when the tracking devices are buried in users' wallets or bags. As a result, there has been considerable interest in using only RF techniques for indoor tracking. Existing RF-only techniques, however, typically require a costly site survey and a floor-plan. In this paper, we present the MERIT system that we designed, implemented, and evaluated. MERIT is significantly different from existing systems in that it is pure RF-based yet it does not require a site survey nor a floor-plan. MERIT tracks users to a room granularity, and it can disambiguate neighboring rooms. This disambiguation is challenging because RF signals can traverse through walls. Also, because of indoor multipath interference, it is difficult to correlate signal strength with distance. In this work, we proposed two techniques for accurate disambiguation: spatial diversity and RF reflector. In our evaluation MERIT achieved an accuracy of 98.9%. MERIT was first conceived for a telecommunication application - intelligent telephone call routing, but it can also be used for other location-aware services","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"14 1","pages":"545-554"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82203893","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.288587
D. Wei, A. Chan, Kevin V. N. Kameri
In senor networks, the data traffic from the sensors are directional towards a data sink and are therefore uneven. The areas nearer the data sink experience higher data traffic and will run out of energy sooner. Circular-layer geometry takes into account the radial data traffic towards the data sink. We may construct an algorithm to divide the network into equal-area circular-layers, which are analogous to the square design in geographical adaptive fidelity (GAF). However, the circular-layer geometry alone has not taken into account the uneven data traffic. This paper proposes a circular-layer algorithm that schedules the sensors into active and sleep states in such a way as to evenly distribute the power consumption throughout the sensor networks. We divide the network into circular layers with the data sink at the center. The algorithm equalizes the lifetime time of all layers so that the nodes near the data sink will not run out of energy sooner. Energy is also wasted in reactive routing where the sensors flood the network with omni-directional route discovery messages to find a suitable route towards the data sink. This algorithm reduces such flooding by directing the route request messages towards the data sink, resulting in more energy saving. The circular-layer geometry alone is serving to save energy. In addition, balancing the power consumption throughout the network yields an additional lifetime extension of 21% in our simulation results of a four-layer scenario
{"title":"Circular-Layer Algorithm for Ad Hoc Sensor Networks to Balance Power Consumption","authors":"D. Wei, A. Chan, Kevin V. N. Kameri","doi":"10.1109/SAHCN.2006.288587","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288587","url":null,"abstract":"In senor networks, the data traffic from the sensors are directional towards a data sink and are therefore uneven. The areas nearer the data sink experience higher data traffic and will run out of energy sooner. Circular-layer geometry takes into account the radial data traffic towards the data sink. We may construct an algorithm to divide the network into equal-area circular-layers, which are analogous to the square design in geographical adaptive fidelity (GAF). However, the circular-layer geometry alone has not taken into account the uneven data traffic. This paper proposes a circular-layer algorithm that schedules the sensors into active and sleep states in such a way as to evenly distribute the power consumption throughout the sensor networks. We divide the network into circular layers with the data sink at the center. The algorithm equalizes the lifetime time of all layers so that the nodes near the data sink will not run out of energy sooner. Energy is also wasted in reactive routing where the sensors flood the network with omni-directional route discovery messages to find a suitable route towards the data sink. This algorithm reduces such flooding by directing the route request messages towards the data sink, resulting in more energy saving. The circular-layer geometry alone is serving to save energy. In addition, balancing the power consumption throughout the network yields an additional lifetime extension of 21% in our simulation results of a four-layer scenario","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"65 1","pages":"945-950"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77801300","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.288409
W. Zhang, Sajal K. Das, Yonghe Liu
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
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：