Pub Date : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534946
Shanying Zhu, Cailian Chen, X. Guan, C. Long
In this paper, we deal with distributed estimation using consensus algorithms for heterogenous wireless sensor networks (WSNs). To accommodate with the heterogeneity, we introduce a novel distributed estimator to track the weighted average of the input signals. Different from existing models, we consider a more practical scenario to take account of hierarchical processing abilities of different sensors: type-I sensors with high processing ability and type-II senors with low processing ability for distributed sensor fusion in WSNs. We investigate the properties of our model and illustrate the feasibility of the proposed estimator via a case study where we use the estimator to track the weighted average of a noisy time-varying signal based on the sensors' noisy and distorted measurements. Convergence analysis in this scenario is given as well as the effect of network topology and estimator parameters are also studied. Simulation results are provided to demonstrate the performance and effectiveness of the proposed estimator.
{"title":"An estimator model for distributed estimation in heterogenous wireless sensor networks","authors":"Shanying Zhu, Cailian Chen, X. Guan, C. Long","doi":"10.1109/WOWMOM.2010.5534946","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534946","url":null,"abstract":"In this paper, we deal with distributed estimation using consensus algorithms for heterogenous wireless sensor networks (WSNs). To accommodate with the heterogeneity, we introduce a novel distributed estimator to track the weighted average of the input signals. Different from existing models, we consider a more practical scenario to take account of hierarchical processing abilities of different sensors: type-I sensors with high processing ability and type-II senors with low processing ability for distributed sensor fusion in WSNs. We investigate the properties of our model and illustrate the feasibility of the proposed estimator via a case study where we use the estimator to track the weighted average of a noisy time-varying signal based on the sensors' noisy and distorted measurements. Convergence analysis in this scenario is given as well as the effect of network topology and estimator parameters are also studied. Simulation results are provided to demonstrate the performance and effectiveness of the proposed estimator.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"7 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":"126612385","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.5534937
A. Detti, P. Loreti, N. Blefari-Melazzi, F. Fedi
The Data Distribution Service (DDS) middleware is enjoying a rapid adoption in high-performance, mission-critical networks. At the same time, the H.264 Scalable Video Coding (SVC) has been recently standardized and it is deemed to be an effective solution for video streaming over a channel with time-varying bandwidth, like the wireless one. In these conditions, it is critical to adapt the video bit-rate to the actual wireless capacity, and bit-rate adaptation is extremely simple for a H.264 SVC video. In this paper we devise, evaluate and demonstrate a technique for streaming H.264 SVC video over a DDS middleware. The contribution is threefold: i) we design a structure of the DDS data-unit able to carry H.264 SVC video-units; ii) we devise a receiver-driven rate-control mechanism based on our DDS data-unit and exploiting specific DDS functionality; iii) we implement and show the effectiveness of our mechanism in an 802.11 wireless scenario, comparing our proposal with other solutions.
{"title":"Streaming H.264 scalable video over data distribution service in a wireless environment","authors":"A. Detti, P. Loreti, N. Blefari-Melazzi, F. Fedi","doi":"10.1109/WOWMOM.2010.5534937","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534937","url":null,"abstract":"The Data Distribution Service (DDS) middleware is enjoying a rapid adoption in high-performance, mission-critical networks. At the same time, the H.264 Scalable Video Coding (SVC) has been recently standardized and it is deemed to be an effective solution for video streaming over a channel with time-varying bandwidth, like the wireless one. In these conditions, it is critical to adapt the video bit-rate to the actual wireless capacity, and bit-rate adaptation is extremely simple for a H.264 SVC video. In this paper we devise, evaluate and demonstrate a technique for streaming H.264 SVC video over a DDS middleware. The contribution is threefold: i) we design a structure of the DDS data-unit able to carry H.264 SVC video-units; ii) we devise a receiver-driven rate-control mechanism based on our DDS data-unit and exploiting specific DDS functionality; iii) we implement and show the effectiveness of our mechanism in an 802.11 wireless scenario, comparing our proposal with other solutions.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"23 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":"125446543","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.5534988
N. Yarkony, K. Sayrafian-Pour, A. Possolo
Energy Harvesting (EH) refers to the process of capturing and storing energy from external sources or ambient environment. Kinetic energy harvested from the human body motion seems to be one of the most convenient and attractive solution for wearable wireless sensors in healthcare applications. Due to their small size, such sensors have a very limited battery power supply, which necessitates frequent recharge or even sensor replacement. Energy harvesting can prolong the battery lifetime of these sensors. This could directly impact their everyday use and significantly help their commercial applications such as remote monitoring. In this paper, our aim is to estimate the amount of harvestable energy from typical human motion. To simplify the measurement process, we focus on the amount of kinetic energy harvested from the human forearm motion. We provide statistical analysis of measurements taken from 40 test subjects over a period of 8 hours during the day. Using this information and knowing the operational architecture of the harvesting device, the distribution of harvestable energy can also be determined. Our objective is to study whether kinetic energy generated by typical human forearm motion could be a promising supplemental energy resource that prolongs the operational lifetime of wearable medical sensors.
{"title":"Statistical modeling of harvestable kinetic energy for wearable medical sensors","authors":"N. Yarkony, K. Sayrafian-Pour, A. Possolo","doi":"10.1109/WOWMOM.2010.5534988","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534988","url":null,"abstract":"Energy Harvesting (EH) refers to the process of capturing and storing energy from external sources or ambient environment. Kinetic energy harvested from the human body motion seems to be one of the most convenient and attractive solution for wearable wireless sensors in healthcare applications. Due to their small size, such sensors have a very limited battery power supply, which necessitates frequent recharge or even sensor replacement. Energy harvesting can prolong the battery lifetime of these sensors. This could directly impact their everyday use and significantly help their commercial applications such as remote monitoring. In this paper, our aim is to estimate the amount of harvestable energy from typical human motion. To simplify the measurement process, we focus on the amount of kinetic energy harvested from the human forearm motion. We provide statistical analysis of measurements taken from 40 test subjects over a period of 8 hours during the day. Using this information and knowing the operational architecture of the harvesting device, the distribution of harvestable energy can also be determined. Our objective is to study whether kinetic energy generated by typical human forearm motion could be a promising supplemental energy resource that prolongs the operational lifetime of wearable medical sensors.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"47 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":"127643139","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.5534942
J. Koskela, A. Gurtov
We present the design and evaluation of a secure peer-to-peer HTTP middleware framework that enables a multitude of web applications without relying on service providers. The framework is designed to be deployed in existing network environments, allowing ordinary users to create private services without investing in network infrastructure. Compared to previous work, scalability, NAT/firewall traversal and peer mobility is achieved without the need for maintaining dedicated servers by utilizing new network protocols and re-using existing network resources.
{"title":"A secure peer-to-peer web framework","authors":"J. Koskela, A. Gurtov","doi":"10.1109/WOWMOM.2010.5534942","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534942","url":null,"abstract":"We present the design and evaluation of a secure peer-to-peer HTTP middleware framework that enables a multitude of web applications without relying on service providers. The framework is designed to be deployed in existing network environments, allowing ordinary users to create private services without investing in network infrastructure. Compared to previous work, scalability, NAT/firewall traversal and peer mobility is achieved without the need for maintaining dedicated servers by utilizing new network protocols and re-using existing network resources.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"121 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":"132025174","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.5534896
Jiao Zhang, Fengyuan Ren, Tao He, Chuang Lin
Data aggregation has been widely recognized as an efficient method to reduce energy consumption in wireless sensor networks, which can support a wide range of applications such as monitoring temperature, humidity, level, speed etc. The data sampled by the same kind of sensors have much redundancy since the sensor nodes are usually quite dense in wireless sensor networks. To make data aggregation more efficient, the packets with the same attribute, defined as the identifier of different data sampled by different sensors such as temperature sensors, humidity sensors, etc., should be gathered together. However, to the best of our knowledge, present data aggregation mechanisms did not take packet attribute into consideration. In this paper, we take the lead in introducing packet attribute into data aggregation and propose an Attribute-aware Data Aggregation mechanism using Dynamic Routing (ADADR) which can make packets with the same attribute convergent as much as possible and therefore improve the efficiency of data aggregation. This goal cannot be achieved by present static routing schemes employed in most of data aggregation mechanisms since they construct routes before transmitting the sampled data and thus can not dynamically forward packets in response to the variation of packets at intermediate nodes. Hence, we present a potential-based dynamic routing scheme which employs the concept of potential in physics and pheromone in ant colony to achieve our goal. The results of simulations in series of scenarios show that ADADR indeed conserve energy by reducing the average number of transmissions each packet needs to reach the sink and is scalable with regard to the network size.
{"title":"Attribute-aware data aggregation using dynamic routing in wireless sensor networks","authors":"Jiao Zhang, Fengyuan Ren, Tao He, Chuang Lin","doi":"10.1109/WOWMOM.2010.5534896","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534896","url":null,"abstract":"Data aggregation has been widely recognized as an efficient method to reduce energy consumption in wireless sensor networks, which can support a wide range of applications such as monitoring temperature, humidity, level, speed etc. The data sampled by the same kind of sensors have much redundancy since the sensor nodes are usually quite dense in wireless sensor networks. To make data aggregation more efficient, the packets with the same attribute, defined as the identifier of different data sampled by different sensors such as temperature sensors, humidity sensors, etc., should be gathered together. However, to the best of our knowledge, present data aggregation mechanisms did not take packet attribute into consideration. In this paper, we take the lead in introducing packet attribute into data aggregation and propose an Attribute-aware Data Aggregation mechanism using Dynamic Routing (ADADR) which can make packets with the same attribute convergent as much as possible and therefore improve the efficiency of data aggregation. This goal cannot be achieved by present static routing schemes employed in most of data aggregation mechanisms since they construct routes before transmitting the sampled data and thus can not dynamically forward packets in response to the variation of packets at intermediate nodes. Hence, we present a potential-based dynamic routing scheme which employs the concept of potential in physics and pheromone in ant colony to achieve our goal. The results of simulations in series of scenarios show that ADADR indeed conserve energy by reducing the average number of transmissions each packet needs to reach the sink and is scalable with regard to the network size.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"5 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":"132145157","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.5534915
Guillaume-Jean Herbiet, P. Bouvry
In this contribution, we present SHARC, a Sharper Heuristic for Assignment of Robust Communities. This algorithm performs distributed network partitioning into communities using epidemic propagation of community labels and the computation of a neighborhood similarity metric. Due to its decentralized nature, SHARC is scalable and well suited for networks where no global knowledge nor node coordination exist, like ad hoc networks. Besides, SHARC is computationally efficient and does not depend on configuration parameters. We validated our approach and compared it to alternative solutions using static and dynamic networks. Results show that SHARC provides a sharper and more robust community assignment and prevents the domination of a single community in both static and dynamic networks.
{"title":"SHARC: Community-based partitioning for mobile ad hoc networks using neighborhood similarity","authors":"Guillaume-Jean Herbiet, P. Bouvry","doi":"10.1109/WOWMOM.2010.5534915","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534915","url":null,"abstract":"In this contribution, we present SHARC, a Sharper Heuristic for Assignment of Robust Communities. This algorithm performs distributed network partitioning into communities using epidemic propagation of community labels and the computation of a neighborhood similarity metric. Due to its decentralized nature, SHARC is scalable and well suited for networks where no global knowledge nor node coordination exist, like ad hoc networks. Besides, SHARC is computationally efficient and does not depend on configuration parameters. We validated our approach and compared it to alternative solutions using static and dynamic networks. Results show that SHARC provides a sharper and more robust community assignment and prevents the domination of a single community in both static and dynamic networks.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"2 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":"133080431","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.5534990
P. Sitbon, W. Feng, N. Bulusu
For many applications in mobile wireless ad hoc networks (MANETs), forming an end-to-end data path is not always necessary; instead, the primary routing goal is often data collection or dissemination where only a data source is known. Routing algorithms must be carefully chosen in order to suit the needs of applications employing them. Our focus is on data collection applications in MANETs where limited mobility information is required to route data in a scalable manner. To address this goal, we employ the concepts of delay-tolerant networking (DTN) in which data makes progress toward a destination with high latency expectations and little knowledge of routing topology. Specifically, we present time-to-network (TTN) forwarding, a method of forwarding data generated by mobile nodes to a network endpoint in such a way that delivery latency is lowered without high networking cost. By segmenting mobility patterns into trips, we are able to apply TTN to a vehicular network using only an estimated destination arrival time for each vehicle. We evaluate TTN using mobility data from the TRANSIMS simulator for a real road network. Results show that our algorithm produces collection-to-network latencies similar to more generic algorithms but at a lower cost and with higher efficiency. Furthermore, we establish a lower bound for delivery latency in our experiments and compare it to TTN. This also helps normalize the interpretation of results specific to our mobility model.
{"title":"TTN: A time-to-network approach to data reporting in mobile ad hoc networks","authors":"P. Sitbon, W. Feng, N. Bulusu","doi":"10.1109/WOWMOM.2010.5534990","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534990","url":null,"abstract":"For many applications in mobile wireless ad hoc networks (MANETs), forming an end-to-end data path is not always necessary; instead, the primary routing goal is often data collection or dissemination where only a data source is known. Routing algorithms must be carefully chosen in order to suit the needs of applications employing them. Our focus is on data collection applications in MANETs where limited mobility information is required to route data in a scalable manner. To address this goal, we employ the concepts of delay-tolerant networking (DTN) in which data makes progress toward a destination with high latency expectations and little knowledge of routing topology. Specifically, we present time-to-network (TTN) forwarding, a method of forwarding data generated by mobile nodes to a network endpoint in such a way that delivery latency is lowered without high networking cost. By segmenting mobility patterns into trips, we are able to apply TTN to a vehicular network using only an estimated destination arrival time for each vehicle. We evaluate TTN using mobility data from the TRANSIMS simulator for a real road network. Results show that our algorithm produces collection-to-network latencies similar to more generic algorithms but at a lower cost and with higher efficiency. Furthermore, we establish a lower bound for delivery latency in our experiments and compare it to TTN. This also helps normalize the interpretation of results specific to our mobility model.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"24 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":"133712469","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.5534940
M. Barbeau
The ubiquity of wireless communications, in the home and office environment, introduces information security risks specific to WLANs and handheld devices. It is crucial to continuously monitor their evolution but every threat must be examined in terms of potential impact and likelihood. Only when both conditions are present, it does need to be mitigated. This paper shows how the problem can be addressed in a methodological manner. By conducting a proper risk assessment we can identify the threats, to the security of wireless communications, that are real and the ones that are inoffensive. Examples related to the protection of confidential information, in the wireless home and office environment, are used to illustrate the point.
{"title":"Assessment of the true risks to the protection of confidential information in the wireless home and office environment","authors":"M. Barbeau","doi":"10.1109/WOWMOM.2010.5534940","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534940","url":null,"abstract":"The ubiquity of wireless communications, in the home and office environment, introduces information security risks specific to WLANs and handheld devices. It is crucial to continuously monitor their evolution but every threat must be examined in terms of potential impact and likelihood. Only when both conditions are present, it does need to be mitigated. This paper shows how the problem can be addressed in a methodological manner. By conducting a proper risk assessment we can identify the threats, to the security of wireless communications, that are real and the ones that are inoffensive. Examples related to the protection of confidential information, in the wireless home and office environment, are used to illustrate the point.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"45 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113956436","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.5534923
Mohammad Reza Pasandideh, M. St-Hilaire
Since Universal Mobile Telecommunications System (UMTS) networks are very expensive to deploy, network optimization is an important issue for service providers to remain competitive. As a result, this paper proposes a new mathematical programming model in order to plan UMTS Release 4.0 networks. Given realistic traffic profile as input, the model simultaneously considers voice and data services as well as network signaling. More precisely, the model finds the number, the type and the location of the network elements (NE), selects the number and the type of links and interfaces and finally designs the network topology. The objective of the model is to minimize network cost. An illustrative example of the model is described and a set of randomly generated problems are solved using a commercial implementation of the branch-and-bound algorithm.
{"title":"Automatic planning of UMTS release 4.0 networks using realistic traffic","authors":"Mohammad Reza Pasandideh, M. St-Hilaire","doi":"10.1109/WOWMOM.2010.5534923","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534923","url":null,"abstract":"Since Universal Mobile Telecommunications System (UMTS) networks are very expensive to deploy, network optimization is an important issue for service providers to remain competitive. As a result, this paper proposes a new mathematical programming model in order to plan UMTS Release 4.0 networks. Given realistic traffic profile as input, the model simultaneously considers voice and data services as well as network signaling. More precisely, the model finds the number, the type and the location of the network elements (NE), selects the number and the type of links and interfaces and finally designs the network topology. The objective of the model is to minimize network cost. An illustrative example of the model is described and a set of randomly generated problems are solved using a commercial implementation of the branch-and-bound algorithm.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"5 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":"127934486","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.5534994
J. Lessmann, M. Schöller, Frank A. Zdarsky
In this paper, we present a novel multipath structure called rope-ladder which combines the advantages of path, node and link protection schemes. We also propose a position-based multipath routing protocol in order to efficiently construct rope-ladders in wireless networks. By design, the paths which are constructed by our protocol are closely together which allows to quickly switch back and forth between them in cases of node or link failures. Hence, the size of loss gaps (i.e. the number of consecutively lost packets) can be minimized. Previous works mostly confine themselves to overall packet loss comparisons. However, the loss gap size is crucial to ensure high quality for gap-sensitive traffic like voice flows. Our multipath structure can also tolerate failures of multiple consecutive nodes on the primary path, and has a superior path diversity and path lifetime compared to even perfect braids. We evaluate the performance of our protocol using analysis and simulations1.
{"title":"Rope ladder routing: Position-based multipath routing for wireless mesh networks","authors":"J. Lessmann, M. Schöller, Frank A. Zdarsky","doi":"10.1109/WOWMOM.2010.5534994","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534994","url":null,"abstract":"In this paper, we present a novel multipath structure called rope-ladder which combines the advantages of path, node and link protection schemes. We also propose a position-based multipath routing protocol in order to efficiently construct rope-ladders in wireless networks. By design, the paths which are constructed by our protocol are closely together which allows to quickly switch back and forth between them in cases of node or link failures. Hence, the size of loss gaps (i.e. the number of consecutively lost packets) can be minimized. Previous works mostly confine themselves to overall packet loss comparisons. However, the loss gap size is crucial to ensure high quality for gap-sensitive traffic like voice flows. Our multipath structure can also tolerate failures of multiple consecutive nodes on the primary path, and has a superior path diversity and path lifetime compared to even perfect braids. We evaluate the performance of our protocol using analysis and simulations1.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"78 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":"129096563","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
扫码关注我们
求助内容：
应助结果提醒方式：