Pub Date : 2006-09-25DOI: 10.1109/WIMESH.2006.288618
Yung Yi, G. Veciana, Sanjay Shakkottai
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to 'learn' how to spatially coordinate and adapt contention patterns. Such an approach could reduce contention, leading to better throughput and energy consumption. To that end we propose a new family of distributed MAC scheduling algorithms combining synchronous two-level priority RTS/CTS handshaking with randomized time slot selection. We prove that for any fixed admissible load such algorithms converge to a feasible schedule (i.e., throughput-optimal). Furthermore, by adaptively biasing time-slot selection probabilities based on past history, one can develop variations that are also provably throughput-optimal and exhibit better convergence rates. Additionally under moderate loads local changes in load would lead to only local changes in contention patterns leading once again to fast convergence. This makes the case for adopting such protocols in wireless multi- hop networks, where aggregate loads and network topology are slowly varying.
{"title":"Learning contention patterns and adapting to load/topology changes in a MAC scheduling algorithm","authors":"Yung Yi, G. Veciana, Sanjay Shakkottai","doi":"10.1109/WIMESH.2006.288618","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288618","url":null,"abstract":"Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to 'learn' how to spatially coordinate and adapt contention patterns. Such an approach could reduce contention, leading to better throughput and energy consumption. To that end we propose a new family of distributed MAC scheduling algorithms combining synchronous two-level priority RTS/CTS handshaking with randomized time slot selection. We prove that for any fixed admissible load such algorithms converge to a feasible schedule (i.e., throughput-optimal). Furthermore, by adaptively biasing time-slot selection probabilities based on past history, one can develop variations that are also provably throughput-optimal and exhibit better convergence rates. Additionally under moderate loads local changes in load would lead to only local changes in contention patterns leading once again to fast convergence. This makes the case for adopting such protocols in wireless multi- hop networks, where aggregate loads and network topology are slowly varying.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125782055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-09-01DOI: 10.1109/WIMESH.2006.288611
A. Aksu, Ozgur Ercetin
We present the optimal number of cooperating nodes in multi-hop virtual multiple-input single-output (vMISO) based cooperative wireless sensor networks as a result of an energy consumption optimization problem in a limiting case of very dense networks. The main advantage of vMISO considered in this work is the increase in transmission range due to diversity and power gain. We demonstrate that it is best to have two cooperating nodes, when vMISO is allowed to have multiple transmissions without power control.
{"title":"Multi-hop cooperative transmissions in wireless sensor networks","authors":"A. Aksu, Ozgur Ercetin","doi":"10.1109/WIMESH.2006.288611","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288611","url":null,"abstract":"We present the optimal number of cooperating nodes in multi-hop virtual multiple-input single-output (vMISO) based cooperative wireless sensor networks as a result of an energy consumption optimization problem in a limiting case of very dense networks. The main advantage of vMISO considered in this work is the increase in transmission range due to diversity and power gain. We demonstrate that it is best to have two cooperating nodes, when vMISO is allowed to have multiple transmissions without power control.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114587025","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288619
Seongkwan Kim, Sung-Ju Lee, Sunghyun Choi
This paper analyzes the impact of different MAC (medium access control) and transmission rate adaptation schemes on wireless mesh networks. The considered protocols include three different MAC protocols specified in IEEE 802.11 standards, i.e., 802.11, 802.11e, and 802.11n, and three rate adaptation schemes, i.e., ARF (automatic rate fallback), RBAR (receiver-based auto rate), and 802.11n rate adaptation. We also study the interactions of these MAC strategies with the state-of-the-art routing metric ETT (expected transmission time). Through comparative simulation evaluations, we investigate the effectiveness of these protocols when they coexist on both single-hop and multi-hop wireless mesh network environments. As these MAC strategies are designed for single-hop WLANs, we observed their limitations on multi-hop wireless mesh networks. We analyze their performances and suggest solutions for improvements. Based on our simulation results, we also argue for the need of a new routing metric that takes advantage of the new emerging MAC features.
{"title":"The impact of IEEE 802.11 MAC strategies on multi-hop wireless mesh networks","authors":"Seongkwan Kim, Sung-Ju Lee, Sunghyun Choi","doi":"10.1109/WIMESH.2006.288619","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288619","url":null,"abstract":"This paper analyzes the impact of different MAC (medium access control) and transmission rate adaptation schemes on wireless mesh networks. The considered protocols include three different MAC protocols specified in IEEE 802.11 standards, i.e., 802.11, 802.11e, and 802.11n, and three rate adaptation schemes, i.e., ARF (automatic rate fallback), RBAR (receiver-based auto rate), and 802.11n rate adaptation. We also study the interactions of these MAC strategies with the state-of-the-art routing metric ETT (expected transmission time). Through comparative simulation evaluations, we investigate the effectiveness of these protocols when they coexist on both single-hop and multi-hop wireless mesh network environments. As these MAC strategies are designed for single-hop WLANs, we observed their limitations on multi-hop wireless mesh networks. We analyze their performances and suggest solutions for improvements. Based on our simulation results, we also argue for the need of a new routing metric that takes advantage of the new emerging MAC features.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"2029 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129775514","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288612
Rahul C. Shah, M. Yarvis
One would expect a body-area network to have consistently good connectivity, given the relatively short distances involved. However, early experimental results suggest otherwise. This poster examines the characteristics of the links in an on-body IEEE 802.15.4 network and the factors that influence link performance. We demonstrate that node location, as well as body position, significantly affects connectivity. For example, connectivity in the sitting position tends to be much worse than standing. We will present a comprehensive evaluation including various combinations of changes in node orientation, node placement, body position, and environmental factors. Preliminary results clearly demonstrate the need for researching different radios, topologies and protocol design to make body area networks viable.
{"title":"Characteristics of on-body 802.15.4 networks","authors":"Rahul C. Shah, M. Yarvis","doi":"10.1109/WIMESH.2006.288612","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288612","url":null,"abstract":"One would expect a body-area network to have consistently good connectivity, given the relatively short distances involved. However, early experimental results suggest otherwise. This poster examines the characteristics of the links in an on-body IEEE 802.15.4 network and the factors that influence link performance. We demonstrate that node location, as well as body position, significantly affects connectivity. For example, connectivity in the sitting position tends to be much worse than standing. We will present a comprehensive evaluation including various combinations of changes in node orientation, node placement, body position, and environmental factors. Preliminary results clearly demonstrate the need for researching different radios, topologies and protocol design to make body area networks viable.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125465658","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288626
O. Arazi, I. Elhanany, D. Rose, H. Qi, B. Arazi
It is widely acknowledged that security will play a key role in the successful design and deployment of wireless sensor networks (WSN). A prerequisite for achieving security is the ability to dynamically establish a secret key joint to two nodes. Elliptic Curve Cryptography (ECC) has emerged as a suitable public key cryptographic foundation for WSN. This poster will present an efficient ECC-based method for self-certified key generation in resource-constrained sensor nodes. In particular, we provide implementation results on the Intel Mote 2 sensor network platform which demonstrate that such key generation can be established in the order of 60 msec while consuming less than 30 mJ.
{"title":"Self-certified public key generation on the intel mote 2 sensor network platform","authors":"O. Arazi, I. Elhanany, D. Rose, H. Qi, B. Arazi","doi":"10.1109/WIMESH.2006.288626","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288626","url":null,"abstract":"It is widely acknowledged that security will play a key role in the successful design and deployment of wireless sensor networks (WSN). A prerequisite for achieving security is the ability to dynamically establish a secret key joint to two nodes. Elliptic Curve Cryptography (ECC) has emerged as a suitable public key cryptographic foundation for WSN. This poster will present an efficient ECC-based method for self-certified key generation in resource-constrained sensor nodes. In particular, we provide implementation results on the Intel Mote 2 sensor network platform which demonstrate that such key generation can be established in the order of 60 msec while consuming less than 30 mJ.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114310789","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288610
A. Ferrer-Vidal, A. Rida, S. Basat, Li Yang, M. Tentzeris
In this paper, an overview of novel integration approaches for improved performance UHF radio frequency identification (RFID) tags and embedded sensors and batteries is presented. Organic substrates, such as paper, that have been very rarely used in UHF and RF applications in the past and could potentially utilize inkjet printing techniques, are also thoroughly investigated for the realization of ultra- low-cost RFID/Sensor tags for frequencies ranging from 13.56 MHz up to 950 MHz for the first time ever. The proposed technology could potentially revolutionize wearable and conformal wireless sensor networks (WSN).
{"title":"Integration of sensors and RFID's on ultra-low-cost paper-based substrates for wireless sensor networks applications","authors":"A. Ferrer-Vidal, A. Rida, S. Basat, Li Yang, M. Tentzeris","doi":"10.1109/WIMESH.2006.288610","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288610","url":null,"abstract":"In this paper, an overview of novel integration approaches for improved performance UHF radio frequency identification (RFID) tags and embedded sensors and batteries is presented. Organic substrates, such as paper, that have been very rarely used in UHF and RF applications in the past and could potentially utilize inkjet printing techniques, are also thoroughly investigated for the realization of ultra- low-cost RFID/Sensor tags for frequencies ranging from 13.56 MHz up to 950 MHz for the first time ever. The proposed technology could potentially revolutionize wearable and conformal wireless sensor networks (WSN).","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"42 5-7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132903211","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288635
Limin Sun, Yanzhong Bi, Jian Ma
In wireless sensor networks, sink mobility has recently been used to improve network performance such as energy efficiency and throughput. However, for the applications that sensed data have to be collected periodically, moving strategies of a mobile sink should be designed carefully to exploit the mobility. We propose a half-quadrant-based moving strategy for mobile sinks in data-gathering sensor networks. The experimental results show that the moving strategy proposed can extend network lifetime in diverse network configurations.
{"title":"A moving strategy for mobile sinks in wireless sensor networks","authors":"Limin Sun, Yanzhong Bi, Jian Ma","doi":"10.1109/WIMESH.2006.288635","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288635","url":null,"abstract":"In wireless sensor networks, sink mobility has recently been used to improve network performance such as energy efficiency and throughput. However, for the applications that sensed data have to be collected periodically, moving strategies of a mobile sink should be designed carefully to exploit the mobility. We propose a half-quadrant-based moving strategy for mobile sinks in data-gathering sensor networks. The experimental results show that the moving strategy proposed can extend network lifetime in diverse network configurations.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"54 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130901732","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288636
Bin Ni, N. Santhapuri, Z. Zhong, Srihari Nelakuditi
Network coding is known to improve network throughput by mixing information from different flows and conveying more information in each transmission. Recently there have been some proposals for applying network coding to wireless mesh networks leveraging the broadcast nature of wireless transmissions. These approaches exploit coding opportunities passively while forwarding packets but they do not proactively change routing of flows to create more coding opportunities. In this paper, we attempt to investigate the extent of performance gain possible when routing decisions are made with the awareness of coding. We first define the expected number of coded transmissions for a successful exchange of packets between two nodes through an intermediate node. We then formulate optimal routing with coding, given the topology and traffic, as a linear programming problem. We conduct a preliminary evaluation of coding-aware routing and show that it offers significant gain particularly when there are many long distance flows.
{"title":"Routing with opportunistically coded exchanges in wireless mesh networks","authors":"Bin Ni, N. Santhapuri, Z. Zhong, Srihari Nelakuditi","doi":"10.1109/WIMESH.2006.288636","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288636","url":null,"abstract":"Network coding is known to improve network throughput by mixing information from different flows and conveying more information in each transmission. Recently there have been some proposals for applying network coding to wireless mesh networks leveraging the broadcast nature of wireless transmissions. These approaches exploit coding opportunities passively while forwarding packets but they do not proactively change routing of flows to create more coding opportunities. In this paper, we attempt to investigate the extent of performance gain possible when routing decisions are made with the awareness of coding. We first define the expected number of coded transmissions for a successful exchange of packets between two nodes through an intermediate node. We then formulate optimal routing with coding, given the topology and traffic, as a linear programming problem. We conduct a preliminary evaluation of coding-aware routing and show that it offers significant gain particularly when there are many long distance flows.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130940257","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288622
M. Cao, V. Raghunathan, P. kumar
The IEEE 802.16 standard, also known as WiMax, provides a mechanism for deploying high-speed wireless mesh network in metropolitan areas. In this paper, we propose an algorithm for the data sub-channel allocation, i.e., transmission scheduling, of WiMax based mesh networks. The goal is to increase spatial reuse, achieve high system throughput, and provide fair access for the subscriber stations. In contrast to the previous "hard" fairness definitions, we introduce a new fairness notion that is imposed contingent on the actual traffic demands, in such a way that a higher capacity region can be achieved. We formulate a scheduling problem whose objective is to maximize the system throughput under our fairness model. We also develop an efficient algorithm to find the optimal schedule and the accompanying resource allocation. The performance of the scheduling algorithm is evaluated through simulations.
{"title":"A tractable algorithm for fair and efficient uplink scheduling of multi-hop wimax mesh networks","authors":"M. Cao, V. Raghunathan, P. kumar","doi":"10.1109/WIMESH.2006.288622","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288622","url":null,"abstract":"The IEEE 802.16 standard, also known as WiMax, provides a mechanism for deploying high-speed wireless mesh network in metropolitan areas. In this paper, we propose an algorithm for the data sub-channel allocation, i.e., transmission scheduling, of WiMax based mesh networks. The goal is to increase spatial reuse, achieve high system throughput, and provide fair access for the subscriber stations. In contrast to the previous \"hard\" fairness definitions, we introduce a new fairness notion that is imposed contingent on the actual traffic demands, in such a way that a higher capacity region can be achieved. We formulate a scheduling problem whose objective is to maximize the system throughput under our fairness model. We also develop an efficient algorithm to find the optimal schedule and the accompanying resource allocation. The performance of the scheduling algorithm is evaluated through simulations.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126871011","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288621
D. Krishnaswamy, Hsien-Po Shiang, J. Vicente, W. Conner, S. Rungta, W. Chan, Kai X. Miao
The dynamic characteristics of wireless mesh network environments make delay-sensitive multimedia applications processing in such networks a very challenging task Cross-layer optimizations are commonly designed to ensure that application requirements are met. Improved timeliness of delivery and precision of information as acquired by a decision- entity can help in effective management of resources and strategies in the mesh network to achieve better application availability, stability, and performance. In this paper, we present an information exchange and database architecture that allows regular updates of cross-layer parameters through distributed database services over an overlay network The architecture provides cross-layer cross-overlay information to enable proactive decision making and distributed optimization for transmission of delay-sensitive application flows in mesh networks. Distributed multi-flow routing optimization over heterogeneous wired + wireless-mesh networks with the suggested information-exchange architecture is also explored.
{"title":"A cross-layer cross-overlay architecture for proactive adaptive processing in mesh networks","authors":"D. Krishnaswamy, Hsien-Po Shiang, J. Vicente, W. Conner, S. Rungta, W. Chan, Kai X. Miao","doi":"10.1109/WIMESH.2006.288621","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288621","url":null,"abstract":"The dynamic characteristics of wireless mesh network environments make delay-sensitive multimedia applications processing in such networks a very challenging task Cross-layer optimizations are commonly designed to ensure that application requirements are met. Improved timeliness of delivery and precision of information as acquired by a decision- entity can help in effective management of resources and strategies in the mesh network to achieve better application availability, stability, and performance. In this paper, we present an information exchange and database architecture that allows regular updates of cross-layer parameters through distributed database services over an overlay network The architecture provides cross-layer cross-overlay information to enable proactive decision making and distributed optimization for transmission of delay-sensitive application flows in mesh networks. Distributed multi-flow routing optimization over heterogeneous wired + wireless-mesh networks with the suggested information-exchange architecture is also explored.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124205667","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
扫码关注我们
求助内容：
应助结果提醒方式：