Pub Date : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534944
Yanzhi Ren, M. Chuah, J. Yang, Yingying Chen
The Disruption Tolerant Networks (DTNs) are especially useful in providing mission critical services such as in emergency networks or battlefield scenarios. However, DTNs are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary nodes launch blackhole attacks by dropping packets in the networks. The traditional approaches of securing routing protocols can not address such insider attacks in DTNs. In this paper, we propose a method to secure the history records of packet delivery information at each contact so that other nodes can detect insider attacks by analyzing these packet delivery records. We evaluated our approach through extensive simulations using both Random Way Point and Zebranet mobility models. Our results show that our method can detect insider attacks efficiently with high detection rate and low false positive rate.
{"title":"Detecting blackhole attacks in Disruption-Tolerant Networks through packet exchange recording","authors":"Yanzhi Ren, M. Chuah, J. Yang, Yingying Chen","doi":"10.1109/WOWMOM.2010.5534944","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534944","url":null,"abstract":"The Disruption Tolerant Networks (DTNs) are especially useful in providing mission critical services such as in emergency networks or battlefield scenarios. However, DTNs are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary nodes launch blackhole attacks by dropping packets in the networks. The traditional approaches of securing routing protocols can not address such insider attacks in DTNs. In this paper, we propose a method to secure the history records of packet delivery information at each contact so that other nodes can detect insider attacks by analyzing these packet delivery records. We evaluated our approach through extensive simulations using both Random Way Point and Zebranet mobility models. Our results show that our method can detect insider attacks efficiently with high detection rate and low false positive rate.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127182460","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534902
Theodoros Dionysiou, V. Siris, G. Stamatakis
We define a utility-based framework for joint channel assignment and topology control in multi-rate multi-radio wireless mesh networks, and present a greedy algorithm for solving the corresponding optimization problem. Key features of the proposed approach are the support for different target objectives, which are expressed as utility functions of the MAC layer throughput, and the efficient utilization of wired network gateways, while guaranteeing that for every mesh node there exists a path to a gateway. Investigations show the influence of different target objectives on the channel assignment and network topology, demonstrate the proposed approach's load balancing properties in mesh networks containing multiple gateways, show the effect of 802.11a adjacent channel interference on the channel assignment, and compare the performance of the proposed procedure with a rate-based channel assignment scheme.
{"title":"Utility-based channel assignment and topology control in wireless mesh networks","authors":"Theodoros Dionysiou, V. Siris, G. Stamatakis","doi":"10.1109/WOWMOM.2010.5534902","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534902","url":null,"abstract":"We define a utility-based framework for joint channel assignment and topology control in multi-rate multi-radio wireless mesh networks, and present a greedy algorithm for solving the corresponding optimization problem. Key features of the proposed approach are the support for different target objectives, which are expressed as utility functions of the MAC layer throughput, and the efficient utilization of wired network gateways, while guaranteeing that for every mesh node there exists a path to a gateway. Investigations show the influence of different target objectives on the channel assignment and network topology, demonstrate the proposed approach's load balancing properties in mesh networks containing multiple gateways, show the effect of 802.11a adjacent channel interference on the channel assignment, and compare the performance of the proposed procedure with a rate-based channel assignment scheme.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131983131","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534951
Tahiry Razafindralambo, D. Simplot-Ryl
In this paper, we consider the self-deployment of wireless sensor networks. We present a mechanism which allows to preserve network connectivity during the deployment of mobile wireless sensors. Our algorithm is distributed and is based on a subset of neighbours for motion decision. Our algorithm maintains a connected topology regardless of the direction chosen by each sensor. To preserve connectivity, the distance covered by the mobile nodes is constrained by the connectivity of the node to its neighbours in a connected subgraph like the relative neighbourhood graph (RNG). We show the connectivity preservation property of our algorithm through analysis and present some simulation results for the full coverage problem.
{"title":"Connectivity guarantee during wireless sensor networks deployment","authors":"Tahiry Razafindralambo, D. Simplot-Ryl","doi":"10.1109/WOWMOM.2010.5534951","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534951","url":null,"abstract":"In this paper, we consider the self-deployment of wireless sensor networks. We present a mechanism which allows to preserve network connectivity during the deployment of mobile wireless sensors. Our algorithm is distributed and is based on a subset of neighbours for motion decision. Our algorithm maintains a connected topology regardless of the direction chosen by each sensor. To preserve connectivity, the distance covered by the mobile nodes is constrained by the connectivity of the node to its neighbours in a connected subgraph like the relative neighbourhood graph (RNG). We show the connectivity preservation property of our algorithm through analysis and present some simulation results for the full coverage problem.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158441","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534914
J. J. Galvez, P. M. Ruiz, A. Gómez-Skarmeta
We propose an adaptive online load-balancing protocol for Multi-Gateway Wireless Mesh Networks (WMNs) which, based on the current network conditions, balances load between gateways. Our protocol (GWLB) achieves two goals: (i) alleviating congestion in affected domains and (ii) balancing load to improve flow fairness across domains. As a result of applying GWLB the throughput and fairness of flows improves. The proposed scheme effectively takes into account the elastic nature of TCP traffic, and intra-flow and inter-flow interference when switching flows between domains. Through simulations, we analyze performance and compare with a number of proposed strategies, showing that GWLB outperforms them. In particular, we have observed average flow throughput gains of 104% over the nearest gateway strategy.
{"title":"A feedback-based adaptive online algorithm for Multi-Gateway load-balancing in wireless mesh networks","authors":"J. J. Galvez, P. M. Ruiz, A. Gómez-Skarmeta","doi":"10.1109/WOWMOM.2010.5534914","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534914","url":null,"abstract":"We propose an adaptive online load-balancing protocol for Multi-Gateway Wireless Mesh Networks (WMNs) which, based on the current network conditions, balances load between gateways. Our protocol (GWLB) achieves two goals: (i) alleviating congestion in affected domains and (ii) balancing load to improve flow fairness across domains. As a result of applying GWLB the throughput and fairness of flows improves. The proposed scheme effectively takes into account the elastic nature of TCP traffic, and intra-flow and inter-flow interference when switching flows between domains. Through simulations, we analyze performance and compare with a number of proposed strategies, showing that GWLB outperforms them. In particular, we have observed average flow throughput gains of 104% over the nearest gateway strategy.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128331610","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534899
Mikkel Koefoed Jakobsen, J. Madsen, M. R. Hansen
One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important that the best energy-wise route is found for each data transfer from a source node to the sink node. We present a new adaptive and distributed routing algorithm for finding energy optimised routes in a wireless sensor network with energy harvesting. The algorithm finds an energy efficient route from each source node to a single sink node, taking into account the current energy status of the network. By simulation, the algorithm is shown to be able to adapt to changes in harvested and stored energy. Simulations show that continuous operation is possible.
{"title":"DEHAR: A distributed energy harvesting aware routing algorithm for ad-hoc multi-hop wireless sensor networks","authors":"Mikkel Koefoed Jakobsen, J. Madsen, M. R. Hansen","doi":"10.1109/WOWMOM.2010.5534899","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534899","url":null,"abstract":"One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important that the best energy-wise route is found for each data transfer from a source node to the sink node. We present a new adaptive and distributed routing algorithm for finding energy optimised routes in a wireless sensor network with energy harvesting. The algorithm finds an energy efficient route from each source node to a single sink node, taking into account the current energy status of the network. By simulation, the algorithm is shown to be able to adapt to changes in harvested and stored energy. Simulations show that continuous operation is possible.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"44 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125993220","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534910
M. Demirbas, Murat Ali Bayir, C. Akcora, Y. Yilmaz, H. Ferhatosmanoğlu
Despite the availability of the sensor and smart-phone devices to fulfill the ubiquitous computing vision, the-state-of-the-art falls short of this vision. We argue that the reason for this gap is the lack of an infrastructure to task/utilize these devices for collaboration. We propose that microblogging services like Twitter can provide an "open" publish-subscribe infrastructure for sensors and smartphones, and pave the way for ubiquitous crowd-sourced sensing and collaboration applications. We design and implement a crowd-sourced sensing and collaboration system over Twitter, and showcase our system in the context of two applications: a crowd-sourced weather radar, and a participatory noise-mapping application. Our results from real-world Twitter experiments give insights into the feasibility of this approach and outline the research challenges in sensor/smartphone integration to Twitter.
{"title":"Crowd-sourced sensing and collaboration using twitter","authors":"M. Demirbas, Murat Ali Bayir, C. Akcora, Y. Yilmaz, H. Ferhatosmanoğlu","doi":"10.1109/WOWMOM.2010.5534910","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534910","url":null,"abstract":"Despite the availability of the sensor and smart-phone devices to fulfill the ubiquitous computing vision, the-state-of-the-art falls short of this vision. We argue that the reason for this gap is the lack of an infrastructure to task/utilize these devices for collaboration. We propose that microblogging services like Twitter can provide an \"open\" publish-subscribe infrastructure for sensors and smartphones, and pave the way for ubiquitous crowd-sourced sensing and collaboration applications. We design and implement a crowd-sourced sensing and collaboration system over Twitter, and showcase our system in the context of two applications: a crowd-sourced weather radar, and a participatory noise-mapping application. Our results from real-world Twitter experiments give insights into the feasibility of this approach and outline the research challenges in sensor/smartphone integration to Twitter.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126120260","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534982
G. Hembroff, S. Muftic
This paper presents several smart card security extensions to the FIPS 201 PIV standard of security and authentication of mobile health. Our contributions are designed to better protect the patient's data and to increase the functionality and interoperability of smart cards in health care. Our solution, called SAMSON, consists of two types of smart cards. The first, a security card, is issued to all personnel within any medical organization, while the second, the medical card, is issued to patients and used to securely store and retrieve health care information. These smart cards are being tested within a 14 hospital federated consortium in Michigan's Upper Peninsula.
{"title":"SAMSON: Secure access for medical smart cards over networks","authors":"G. Hembroff, S. Muftic","doi":"10.1109/WOWMOM.2010.5534982","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534982","url":null,"abstract":"This paper presents several smart card security extensions to the FIPS 201 PIV standard of security and authentication of mobile health. Our contributions are designed to better protect the patient's data and to increase the functionality and interoperability of smart cards in health care. Our solution, called SAMSON, consists of two types of smart cards. The first, a security card, is issued to all personnel within any medical organization, while the second, the medical card, is issued to patients and used to securely store and retrieve health care information. These smart cards are being tested within a 14 hospital federated consortium in Michigan's Upper Peninsula.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122331077","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534894
Maulik Desai, N. Maxemchuk
We propose Polar Coordinate Routing (PCR) to create multiple paths between a source and a destination in wireless networks. Our scheme creates paths that are circular segments of different radii connecting a source and a destination. We propose a non-euclidean distance metric that allows messages to travel along these paths. Using PCR it is possible to maintain a known separation among the paths, which reduces the interference between the nodes belonging to two separate routes. Our extensive simulations show that while PCR achieves a known separation between the routes, it does so with a small increase in overall hop count. Moreover, we demonstrate that the variances of average separation and hop count are lower for the paths created using PCR compared to existing schemes, indicating a more reliable system. Existing multi-path routing schemes in wireless networks do not perform well in areas with obstacles or low node density. To overcome adverse areas in a network, we integrate PCR with simple robotic routing, which lets a message circumnavigate an obstacle and follow the trajectory to the destination as soon as the obstacle is passed.l
{"title":"Polar coordinate routing for multiple paths in wireless networks","authors":"Maulik Desai, N. Maxemchuk","doi":"10.1109/WOWMOM.2010.5534894","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534894","url":null,"abstract":"We propose Polar Coordinate Routing (PCR) to create multiple paths between a source and a destination in wireless networks. Our scheme creates paths that are circular segments of different radii connecting a source and a destination. We propose a non-euclidean distance metric that allows messages to travel along these paths. Using PCR it is possible to maintain a known separation among the paths, which reduces the interference between the nodes belonging to two separate routes. Our extensive simulations show that while PCR achieves a known separation between the routes, it does so with a small increase in overall hop count. Moreover, we demonstrate that the variances of average separation and hop count are lower for the paths created using PCR compared to existing schemes, indicating a more reliable system. Existing multi-path routing schemes in wireless networks do not perform well in areas with obstacles or low node density. To overcome adverse areas in a network, we integrate PCR with simple robotic routing, which lets a message circumnavigate an obstacle and follow the trajectory to the destination as soon as the obstacle is passed.l","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037529","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534952
W. Shi, M. Barbeau, J. Corriveau
In ad hoc networks and wireless sensor networks, several routing algorithms rely on the knowledge by the network nodes of their own geographic location and those of others. For cases where a node doesn't have its own positioning device (e.g., GPS), Alfaro et al. propose several algorithms that a node can run to determine its geographic position using position reports from neighbors. In this paper, we first present the evil ring attack, an attack on the geographic location algorithms of Alfaro et al. that misleads nodes about the true position of their neighbors. An attacker sends false reports with a position that sits on a circle centered at the victim's location and of a radius equal to the distance between the victim and attacker. The attack succeeds because the calculation of the distance between the victim and attacker is not affected despite this fake position. We then present and analyze an evil ring attack detection algorithm in which a position-unaware sensor node crosschecks the consistency of the information it collects from its neighbors with the information collected by other trusted neighbors. This algorithm detects the existence of neighbors running the evil ring attack. We propose a general distributed algorithm for a) localizing sensors in a wireless sensor network in the presence of some malfunctioning ones, and b) detecting such malfunctioning sensors.
{"title":"Detection of the Evil ring attack in wireless sensor networks using cross verification","authors":"W. Shi, M. Barbeau, J. Corriveau","doi":"10.1109/WOWMOM.2010.5534952","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534952","url":null,"abstract":"In ad hoc networks and wireless sensor networks, several routing algorithms rely on the knowledge by the network nodes of their own geographic location and those of others. For cases where a node doesn't have its own positioning device (e.g., GPS), Alfaro et al. propose several algorithms that a node can run to determine its geographic position using position reports from neighbors. In this paper, we first present the evil ring attack, an attack on the geographic location algorithms of Alfaro et al. that misleads nodes about the true position of their neighbors. An attacker sends false reports with a position that sits on a circle centered at the victim's location and of a radius equal to the distance between the victim and attacker. The attack succeeds because the calculation of the distance between the victim and attacker is not affected despite this fake position. We then present and analyze an evil ring attack detection algorithm in which a position-unaware sensor node crosschecks the consistency of the information it collects from its neighbors with the information collected by other trusted neighbors. This algorithm detects the existence of neighbors running the evil ring attack. We propose a general distributed algorithm for a) localizing sensors in a wireless sensor network in the presence of some malfunctioning ones, and b) detecting such malfunctioning sensors.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129245026","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534941
F. Proto, Claudio Pisa
The Optimized Link State Routing (OLSR) protocol is widely employed in Wireless Community Networks (WCNs), where users are connected to a wireless backbone with high bandwidth links. In these networks users can access both the Internet and internal network services. However the routers lack multicast support and users cannot exploit the high capacity of wireless links to stream and receive multimedia services. We implemented an extension to the OLSR protocol to support the delivery of multicast traffic using the Overlay Borovka-based Ad-hoc Multicast Protocol (OBAMP). We present a demo of our implementation that is devised for the GNU/Linux operating system. The implementation has been tested both on standard PCs and on embedded devices running OpenWRT and it is distributed as a plugin within the olsr.org OLSR implementation. This protocol enhancement makes possible to create a multicast distribution tree among a subset of nodes, providing the mesh users with multicast community services.
优化链路状态路由(OLSR)协议广泛应用于无线社区网络(Wireless Community network, wcn)中，用户需要连接到具有高带宽链路的无线骨干网。在这些网络中，用户可以访问Internet和内部网络服务。然而，路由器缺乏组播支持，用户无法利用无线链路的高容量进行流传输和接收多媒体业务。我们实现了对OLSR协议的扩展，以支持使用基于Overlay borovka的Ad-hoc多播协议(OBAMP)传输多播流量。我们展示了为GNU/Linux操作系统设计的实现的演示。该实现已经在标准pc和运行OpenWRT的嵌入式设备上进行了测试，并且它作为olsr.org OLSR实现中的插件发布。该协议增强使得在节点子集之间创建组播分布树成为可能，从而为网格用户提供组播社区服务。
{"title":"Implementation of the OBAMP overlay protocol for multicast delivery in OLSR wireless community networks","authors":"F. Proto, Claudio Pisa","doi":"10.1109/WOWMOM.2010.5534941","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534941","url":null,"abstract":"The Optimized Link State Routing (OLSR) protocol is widely employed in Wireless Community Networks (WCNs), where users are connected to a wireless backbone with high bandwidth links. In these networks users can access both the Internet and internal network services. However the routers lack multicast support and users cannot exploit the high capacity of wireless links to stream and receive multimedia services. We implemented an extension to the OLSR protocol to support the delivery of multicast traffic using the Overlay Borovka-based Ad-hoc Multicast Protocol (OBAMP). We present a demo of our implementation that is devised for the GNU/Linux operating system. The implementation has been tested both on standard PCs and on embedded devices running OpenWRT and it is distributed as a plugin within the olsr.org OLSR implementation. This protocol enhancement makes possible to create a multicast distribution tree among a subset of nodes, providing the mesh users with multicast community services.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623735","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
扫码关注我们
求助内容：
应助结果提醒方式：