Pub Date : 2009-02-02DOI: 10.1109/WONS.2009.4801838
S. Suenaga, Nobukazu Yoshioka, S. Honiden
Wireless sensor networks (WSN) consist of spatially distributed nodes that monitor physical conditions. In the past, most WSNs have been designed with a single specific application in mind. Recent developments however are expanding the applicability of WSNs and are increasing the demand for deploying multiple applications simultaneously. To host multiple applications in a single WSN, current solutions provide mechanisms for components to be dynamically deployed to nodes. However, two issues make the present form of dynamic deployment impractical for applications involving distributed collaboration and the redeployment of multiple distributed components. For one, existing works lack a suitable architecture for cooperation and interaction between components in WSNs. Another problematic aspect is the insufficiency of current methods in efficiently deploying multiple components throughout the network. To address these issues, we propose an architecture based on multiple components that have specific responsibilities in regard to deployment and a generative approach for dynamic deployment of such components.
{"title":"Generative dynamic deployment of multiple components in wireless sensor networks","authors":"S. Suenaga, Nobukazu Yoshioka, S. Honiden","doi":"10.1109/WONS.2009.4801838","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801838","url":null,"abstract":"Wireless sensor networks (WSN) consist of spatially distributed nodes that monitor physical conditions. In the past, most WSNs have been designed with a single specific application in mind. Recent developments however are expanding the applicability of WSNs and are increasing the demand for deploying multiple applications simultaneously. To host multiple applications in a single WSN, current solutions provide mechanisms for components to be dynamically deployed to nodes. However, two issues make the present form of dynamic deployment impractical for applications involving distributed collaboration and the redeployment of multiple distributed components. For one, existing works lack a suitable architecture for cooperation and interaction between components in WSNs. Another problematic aspect is the insufficiency of current methods in efficiently deploying multiple components throughout the network. To address these issues, we propose an architecture based on multiple components that have specific responsibilities in regard to deployment and a generative approach for dynamic deployment of such components.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128405476","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801837
Abdelmajid Khelil, F. Shaikh, Azad Ali, N. Suri
Wireless Sensor Networks are seeing increasing usage in several applications such as military, rescue and surveillance scenarios. Typical for such scenarios is that mobile nodes cooperate side-by-side with stationary sensor nodes to monitor the area of interest and to support the core network operations such as data transport. Global maps of the sensor field, such as temperature and residual energy maps, are of high interest for both users and network designers. However, the map construction can become very inefficient if it requires an extensive intervention of the resource-limited sensor nodes. In this work, we present gMAP, an extremely efficient mobility-assisted approach to construct global maps. In gMAP (a) sensor nodes do not need to process readings of other nodes and (b) require to communicate a minimal number of messages compared to all existing approaches. This is achieved by opportunistically exploiting node mobility to collect data of interest, keeping sensor nodes transmit only their own readings on-demand to a mobile node in their transmission area.
{"title":"gMAP: Efficient construction of global maps for mobility-assisted wireless sensor networks","authors":"Abdelmajid Khelil, F. Shaikh, Azad Ali, N. Suri","doi":"10.1109/WONS.2009.4801837","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801837","url":null,"abstract":"Wireless Sensor Networks are seeing increasing usage in several applications such as military, rescue and surveillance scenarios. Typical for such scenarios is that mobile nodes cooperate side-by-side with stationary sensor nodes to monitor the area of interest and to support the core network operations such as data transport. Global maps of the sensor field, such as temperature and residual energy maps, are of high interest for both users and network designers. However, the map construction can become very inefficient if it requires an extensive intervention of the resource-limited sensor nodes. In this work, we present gMAP, an extremely efficient mobility-assisted approach to construct global maps. In gMAP (a) sensor nodes do not need to process readings of other nodes and (b) require to communicate a minimal number of messages compared to all existing approaches. This is achieved by opportunistically exploiting node mobility to collect data of interest, keeping sensor nodes transmit only their own readings on-demand to a mobile node in their transmission area.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126246397","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801857
Y. Fuwa, H. Oda, Tomohiro Takeda, K. Fuwa, Masashi Miyagi, Masaaki Niimura, H. Kunimune, Eiki Motoyama
We are currently developing a Regional Protection System in which children have terminals, and transponders installed at various locations receive packets sent from these terminals via a Specified Low-Power Radio System. The packets are then transmitted to a server so the positions of the children can be inferred from that information. With the ARIB STD-T67 access protocol used in this system, collisions frequently occur at locations where there are many terminals. Therefore, the authors improved a protocol in which frequent collisions do not occur, even when as many as 150 terminals gather in the same place. However, it was impossible to prevent frequent collisions when many terminals are concentrated in one place, such as in a school. A new access protocol was developed in this research to deal with this problem. In this protocol, transmission by terminals is suppressed at specific locations, and then resumed after the terminal moves away from those locations. However, the position of a terminal must not be lost when its transmission is being restricted. In this presentation, we propose this new access protocol, and evaluate its effectiveness.
{"title":"Packet suppression protocol for a regional protection system using a wireless ad-hoc network","authors":"Y. Fuwa, H. Oda, Tomohiro Takeda, K. Fuwa, Masashi Miyagi, Masaaki Niimura, H. Kunimune, Eiki Motoyama","doi":"10.1109/WONS.2009.4801857","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801857","url":null,"abstract":"We are currently developing a Regional Protection System in which children have terminals, and transponders installed at various locations receive packets sent from these terminals via a Specified Low-Power Radio System. The packets are then transmitted to a server so the positions of the children can be inferred from that information. With the ARIB STD-T67 access protocol used in this system, collisions frequently occur at locations where there are many terminals. Therefore, the authors improved a protocol in which frequent collisions do not occur, even when as many as 150 terminals gather in the same place. However, it was impossible to prevent frequent collisions when many terminals are concentrated in one place, such as in a school. A new access protocol was developed in this research to deal with this problem. In this protocol, transmission by terminals is suppressed at specific locations, and then resumed after the terminal moves away from those locations. However, the position of a terminal must not be lost when its transmission is being restricted. In this presentation, we propose this new access protocol, and evaluate its effectiveness.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130075930","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801831
Thi-Minh-Dung Tran, B. Scheuermann, M. Mauve
In this paper we propose a distributed algorithm to detect whether a given node is present or absent in an ad-hoc network. This information is valuable since many proposed protocols and applications for MANETs exhibit worst-case behavior when an intended communication partner is currently not present. Our distributed algorithm improves upon existing approaches to presence detection by significantly reducing the overhead that is required to decide whether a node is present: a reduction by 70−80% is well possible. We describe the proposed algorithm and assess its properties both analytically and through simulation.
{"title":"Node presence detection with reduced overhead","authors":"Thi-Minh-Dung Tran, B. Scheuermann, M. Mauve","doi":"10.1109/WONS.2009.4801831","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801831","url":null,"abstract":"In this paper we propose a distributed algorithm to detect whether a given node is present or absent in an ad-hoc network. This information is valuable since many proposed protocols and applications for MANETs exhibit worst-case behavior when an intended communication partner is currently not present. Our distributed algorithm improves upon existing approaches to presence detection by significantly reducing the overhead that is required to decide whether a node is present: a reduction by 70−80% is well possible. We describe the proposed algorithm and assess its properties both analytically and through simulation.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127876656","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801842
Kevin C. Lee, U. Lee, M. Gerla
Road topology information has recently been used to assist geo-routing, thereby improving the overall performance. However, the unreliable wireless channel nature in urban vehicular grids (due to motion, obstructions, etc) still creates problems with the basic greedy forwarding. In this paper, we propose TO-GO (TOpology-assisted Geo-Opportunistic Routing), a geo-routing protocol that exploits topology knowledge acquired via 2-hop beaconing to select the best target forwarder and incorporates opportunistic forwarding with the best chance to reach it. The forwarder selection takes into account of wireless channel quality, thus significantly improving performance in error and interference situations. Extensive simulations confirm TO-GO superior robustness to errors/losses as compared to conventional topology-assisted geographic routing.
{"title":"TO-GO: TOpology-assist geo-opportunistic routing in urban vehicular grids","authors":"Kevin C. Lee, U. Lee, M. Gerla","doi":"10.1109/WONS.2009.4801842","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801842","url":null,"abstract":"Road topology information has recently been used to assist geo-routing, thereby improving the overall performance. However, the unreliable wireless channel nature in urban vehicular grids (due to motion, obstructions, etc) still creates problems with the basic greedy forwarding. In this paper, we propose TO-GO (TOpology-assisted Geo-Opportunistic Routing), a geo-routing protocol that exploits topology knowledge acquired via 2-hop beaconing to select the best target forwarder and incorporates opportunistic forwarding with the best chance to reach it. The forwarder selection takes into account of wireless channel quality, thus significantly improving performance in error and interference situations. Extensive simulations confirm TO-GO superior robustness to errors/losses as compared to conventional topology-assisted geographic routing.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121497820","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801858
Yanxiang He, Yiran Han, Q. Cao, Tao Liu, Libing Wu
LDoS (Low-rate Denial of Service) attack is periodic, stealthy, and with high efficiency, which has become a great threat to the network security. Previous researches about LDoS attack mainly focus on its impact on wired networks. However, our analysis shows that such attack could also be launched in Ad-hoc network, and as a completely distinct MAC layer protocol is adopted in this environment, the form and effect of the attack could be different and need re-evaluation. This paper presents a study of LDoS attack in Ad-hoc network: (1) We investigate the differences of attack form brought by the medium reservation mechanism and CSMA/CA of 802.11b, and find that decreasing the period of LDoS attack into a smaller time scale would achieve a higher attack efficiency; (2) We show that the attack effect differs from that in wired networks, and the attacker's location has an impact on it; (3) We verify our findings by simulation experiments in NS-2; (4) Detection and defense methods are explored to counter against such attack.
LDoS (Low-rate Denial of Service)攻击具有周期性、隐蔽性、高效性等特点，已成为网络安全的一大威胁。以往关于ddos攻击的研究主要集中在其对有线网络的影响上。然而，我们的分析表明，这种攻击也可以在Ad-hoc网络中发起，并且由于在这种环境中采用了完全不同的MAC层协议，因此攻击的形式和效果可能会有所不同，需要重新评估。本文对Ad-hoc网络中的LDoS攻击进行了研究:(1)研究了802.11b的介质保留机制和CSMA/CA带来的攻击形式的差异，发现将LDoS攻击的周期减小到更小的时间尺度可以获得更高的攻击效率;(2)研究表明，攻击效果不同于有线网络，攻击者的位置对其有影响;(3)我们通过NS-2的模拟实验验证了我们的发现;(4)探索了防范此类攻击的检测和防御方法。
{"title":"LDoS attack in ad-hoc network","authors":"Yanxiang He, Yiran Han, Q. Cao, Tao Liu, Libing Wu","doi":"10.1109/WONS.2009.4801858","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801858","url":null,"abstract":"LDoS (Low-rate Denial of Service) attack is periodic, stealthy, and with high efficiency, which has become a great threat to the network security. Previous researches about LDoS attack mainly focus on its impact on wired networks. However, our analysis shows that such attack could also be launched in Ad-hoc network, and as a completely distinct MAC layer protocol is adopted in this environment, the form and effect of the attack could be different and need re-evaluation. This paper presents a study of LDoS attack in Ad-hoc network: (1) We investigate the differences of attack form brought by the medium reservation mechanism and CSMA/CA of 802.11b, and find that decreasing the period of LDoS attack into a smaller time scale would achieve a higher attack efficiency; (2) We show that the attack effect differs from that in wired networks, and the attacker's location has an impact on it; (3) We verify our findings by simulation experiments in NS-2; (4) Detection and defense methods are explored to counter against such attack.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131795956","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801850
Abdalkarim Awad, Lei Shi, R. German, F. Dressler
We study the capabilities of virtual addressing schemes for efficient and failure tolerant routing in sensor networks. In particular, we present the Virtual Cord Protocol (VCP) that uses techniques known from peer-to-peer networks, i.e. Distributed Hash Tables (DHTs) are used to associate data items in sensor networks with particular node addresses. The addresses of nodes are dynamically maintained by the protocol to form a virtual cord. VCP uses two mechanisms for finding paths to nodes and associated data items: First, it relies on the virtual cord that always points towards the destination. Furthermore, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the possible shortest path with very low overhead. The routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g. Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. The results presented in this paper outline the capabilities of VCP to handle such cases.
{"title":"Advantages of virtual addressing for efficient and failure tolerant routing in sensor networks","authors":"Abdalkarim Awad, Lei Shi, R. German, F. Dressler","doi":"10.1109/WONS.2009.4801850","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801850","url":null,"abstract":"We study the capabilities of virtual addressing schemes for efficient and failure tolerant routing in sensor networks. In particular, we present the Virtual Cord Protocol (VCP) that uses techniques known from peer-to-peer networks, i.e. Distributed Hash Tables (DHTs) are used to associate data items in sensor networks with particular node addresses. The addresses of nodes are dynamically maintained by the protocol to form a virtual cord. VCP uses two mechanisms for finding paths to nodes and associated data items: First, it relies on the virtual cord that always points towards the destination. Furthermore, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the possible shortest path with very low overhead. The routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g. Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. The results presented in this paper outline the capabilities of VCP to handle such cases.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584425","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801843
Biao Zhou, Z. Cao, M. Gerla
Nowadays, inter-domain routing for MANETs draws increasing attention because of military and vehicular applications. The challenges in wireless, mobile inter-domain routing include dynamic network topology, intermittent connectivity, and routing protocol heterogeneity. The existing Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol for the Internet. But BGP is not applicable to MANETs because the BGP design is based on a static Internet which does not support dynamic discovery of members, and cannot scale to mobile, dynamic topology environments. The proposed cluster-based inter-domain routing (CIDR) protocol obtains efficient communications among MANETs and achieves scalability in large networks by using the clustering technique. The proposed approach generates clusters using group affinity. In each domain, the distributed clustering algorithm discovers the set of “traveling companions” - these are the nodes that stick together as a group for some time or for some common tasks. It elects within each set a Cluster Head (CH) for each affinity group. Affinity is defined in terms of some common characteristics, such as group motion or task. The clusters (i.e., subnets) can be defined a priori or may evolve dynamically by the affinity of geography, motion, or task. The cluster head in the subnet acts as local DNS for own cluster and also (redundantly) for neighbor clusters. The cluster head advertises to neighbors and the rest of the network its connectivity, members, and domain information. The advertising protocol plays the role of BG Protocol. In the proposed protocol, packets to remote nodes are routed via cluster-head advertised routes, and packets to local destinations are routed using the local routing algorithm. The experiments have shown that the proposed inter-domain routing has achieved scalability and robustness to mobility.
{"title":"Cluster-based inter-domain routing (cidr) protocol for MANETs","authors":"Biao Zhou, Z. Cao, M. Gerla","doi":"10.1109/WONS.2009.4801843","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801843","url":null,"abstract":"Nowadays, inter-domain routing for MANETs draws increasing attention because of military and vehicular applications. The challenges in wireless, mobile inter-domain routing include dynamic network topology, intermittent connectivity, and routing protocol heterogeneity. The existing Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol for the Internet. But BGP is not applicable to MANETs because the BGP design is based on a static Internet which does not support dynamic discovery of members, and cannot scale to mobile, dynamic topology environments. The proposed cluster-based inter-domain routing (CIDR) protocol obtains efficient communications among MANETs and achieves scalability in large networks by using the clustering technique. The proposed approach generates clusters using group affinity. In each domain, the distributed clustering algorithm discovers the set of “traveling companions” - these are the nodes that stick together as a group for some time or for some common tasks. It elects within each set a Cluster Head (CH) for each affinity group. Affinity is defined in terms of some common characteristics, such as group motion or task. The clusters (i.e., subnets) can be defined a priori or may evolve dynamically by the affinity of geography, motion, or task. The cluster head in the subnet acts as local DNS for own cluster and also (redundantly) for neighbor clusters. The cluster head advertises to neighbors and the rest of the network its connectivity, members, and domain information. The advertising protocol plays the role of BG Protocol. In the proposed protocol, packets to remote nodes are routed via cluster-head advertised routes, and packets to local destinations are routed using the local routing algorithm. The experiments have shown that the proposed inter-domain routing has achieved scalability and robustness to mobility.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126582777","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801845
Mirza Tayyab Mehmood, Abdelwaheb Marzouki, D. Zeghlache
A decentralized link adaptation algorithm designed for multi-link MIMO interference systems to jointly optimize the power and the number of links is presented in this contribution. Game theory is adapted and used for both allocating resources and admitting users (i.e. with embedded congestion control). The MIMO interference system is mapped into a multi-player game. The solution of the proposed game is provided by a new gradient based decentralized link adaptation algorithm. The new algorithm allocates adaptively the power and the modulation scheme of the transmitter and maintains the optimum number of links using soft decision criteria based on the link metric. Each link decision depends on the type of traffic and the QoS requirements. An analytical framework is provided along with simulations and an analysis of the algorithm behavior under different system conditions. This type of algorithm is applicable to spectrum sharing and power management to reduce interference and energy consumption.
{"title":"Decentralized link adaptation for multi-link MIMO interference system","authors":"Mirza Tayyab Mehmood, Abdelwaheb Marzouki, D. Zeghlache","doi":"10.1109/WONS.2009.4801845","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801845","url":null,"abstract":"A decentralized link adaptation algorithm designed for multi-link MIMO interference systems to jointly optimize the power and the number of links is presented in this contribution. Game theory is adapted and used for both allocating resources and admitting users (i.e. with embedded congestion control). The MIMO interference system is mapped into a multi-player game. The solution of the proposed game is provided by a new gradient based decentralized link adaptation algorithm. The new algorithm allocates adaptively the power and the modulation scheme of the transmitter and maintains the optimum number of links using soft decision criteria based on the link metric. Each link decision depends on the type of traffic and the QoS requirements. An analytical framework is provided along with simulations and an analysis of the algorithm behavior under different system conditions. This type of algorithm is applicable to spectrum sharing and power management to reduce interference and energy consumption.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"2357 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130669","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 : 2009-02-02DOI: 10.1109/WONS.2009.4801852
Simone Del Favero, F. Librino, F. Zorzi, Albert F. Harris III, M. Zorzi
The wide variety of applications for wireless sensor networks combined with the energy constrained nature of sensor nodes has motivated research on algorithms for in-network estimation of measured physical quantities to reduce the amount of data that needs to be transmitted to the sink. The main contribution of this work is a distributed estimation solution that leverages the broadcast nature of the wireless channel in sensor networks.We present a data dissemination protocol, called Kalsip, which is designed to support the implementation of our distributed estimation algorithm based on Kalman filters. We show, through analysis and simulation, that our protocol provides accurate estimation of physical properties while minimizing the number of transmissions needed and requiring nodes to only overhear estimates broadcast by their neighbors.
{"title":"A distributed solution to estimation problems in wireless sensor networks leveraging broadcast communication","authors":"Simone Del Favero, F. Librino, F. Zorzi, Albert F. Harris III, M. Zorzi","doi":"10.1109/WONS.2009.4801852","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801852","url":null,"abstract":"The wide variety of applications for wireless sensor networks combined with the energy constrained nature of sensor nodes has motivated research on algorithms for in-network estimation of measured physical quantities to reduce the amount of data that needs to be transmitted to the sink. The main contribution of this work is a distributed estimation solution that leverages the broadcast nature of the wireless channel in sensor networks.We present a data dissemination protocol, called Kalsip, which is designed to support the implementation of our distributed estimation algorithm based on Kalman filters. We show, through analysis and simulation, that our protocol provides accurate estimation of physical properties while minimizing the number of transmissions needed and requiring nodes to only overhear estimates broadcast by their neighbors.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129427946","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
扫码关注我们
求助内容：
应助结果提醒方式：