Pub Date : 2012-04-01DOI: 10.4018/ijwnbt.2012040103
H. Saini, L. Sharma, T. C. Panda, H. N. Pratihari
In the current era of cellular world, cell planning plays an important role to achieve better performance of the cellular network. Capacity expansion and cost optimization of a newly activated base station by placing it at an optimized location is one of the primary objectives of the current manuscript. The locations of the new as well as the existing base stations are directly correlated to the required capacity demand and the power of the received signal at the base station which becomes the sensitive parameter for the cell planning. Therefore, cell planning is to be modeled to optimize the location of the base stations in the form of a linear programming problem. Further, the MEMETIC algorithm has to be used for the optimization of the multi-objectives of the scenario. The simulated results show that there is a significant enhancement in the capacity of the base stations (1% to 5%) as compared with the orientation of base stations achieved by random deployment.
{"title":"Extended Cell Planning for Capacity Expansion and Power Optimization by Using MEMETIC Algorithm","authors":"H. Saini, L. Sharma, T. C. Panda, H. N. Pratihari","doi":"10.4018/ijwnbt.2012040103","DOIUrl":"https://doi.org/10.4018/ijwnbt.2012040103","url":null,"abstract":"In the current era of cellular world, cell planning plays an important role to achieve better performance of the cellular network. Capacity expansion and cost optimization of a newly activated base station by placing it at an optimized location is one of the primary objectives of the current manuscript. The locations of the new as well as the existing base stations are directly correlated to the required capacity demand and the power of the received signal at the base station which becomes the sensitive parameter for the cell planning. Therefore, cell planning is to be modeled to optimize the location of the base stations in the form of a linear programming problem. Further, the MEMETIC algorithm has to be used for the optimization of the multi-objectives of the scenario. The simulated results show that there is a significant enhancement in the capacity of the base stations (1% to 5%) as compared with the orientation of base stations achieved by random deployment.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124616233","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 : 2012-04-01DOI: 10.4018/ijwnbt.2012040102
Shrawan Kumar, D. K. Lobiyal
Obtaining precise location of sensor nodes at low energy consumption, less hardware requirement, and little computation is a challenging task. As one of the well-known range-free localization algorithm, DV-Hop can be simply implemented in wireless sensor networks, but it provides poor localization accuracy. Therefore, in this paper, the authors propose an enhanced DV-Hop localization algorithm that provides good localization accuracy without requiring additional hardware and communication messages in the network. The first two steps of proposed algorithm are similar to the respective steps of the DV-Hop algorithm. In the third step, they first separate error terms (correction factors) of the estimated distance between unknown node and anchor node. The authors then minimize these error terms by using linear programming to obtain better location accuracy. Furthermore, they enhance location accuracy of nodes by introducing weight matrix in the objective function of linear programming problem formulation. Simulation results show that the performance of our proposed algorithm is superior to DV-Hop algorithm and DV-Hop–based algorithms in all considered scenarios.
{"title":"An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks","authors":"Shrawan Kumar, D. K. Lobiyal","doi":"10.4018/ijwnbt.2012040102","DOIUrl":"https://doi.org/10.4018/ijwnbt.2012040102","url":null,"abstract":"Obtaining precise location of sensor nodes at low energy consumption, less hardware requirement, and little computation is a challenging task. As one of the well-known range-free localization algorithm, DV-Hop can be simply implemented in wireless sensor networks, but it provides poor localization accuracy. Therefore, in this paper, the authors propose an enhanced DV-Hop localization algorithm that provides good localization accuracy without requiring additional hardware and communication messages in the network. The first two steps of proposed algorithm are similar to the respective steps of the DV-Hop algorithm. In the third step, they first separate error terms (correction factors) of the estimated distance between unknown node and anchor node. The authors then minimize these error terms by using linear programming to obtain better location accuracy. Furthermore, they enhance location accuracy of nodes by introducing weight matrix in the objective function of linear programming problem formulation. Simulation results show that the performance of our proposed algorithm is superior to DV-Hop algorithm and DV-Hop–based algorithms in all considered scenarios.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124669534","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 : 2011-10-01DOI: 10.4018/IJWNBT.2011100101
G. Ali, E. Chan
Recently data dissemination using Road Side Units RSUs in Vehicular Ad Hoc Networks VANETs received considerable attention for overcoming the vehicle to vehicle frequent disconnection problem. An RSU becomes overloaded due to its mounting location and/or during rush hour overload. As an RSU has short wireless transmission coverage range and vehicles are mobile, a heavily overloaded RSU may experience high deadline miss rate in effect of serving too many requests beyond its capacity. In this work, the authors propose a co-operative multiple-RSU model, which offers the opportunity to the RSUs with high volume workload to transfer some of its overloaded requests to other RSUs that have light workload and located in the direction in which the vehicle is heading. Moreover, for performing the load balancing, the authors propose three different heuristic load transfer approaches. By a series of simulation experiments, the authors demonstrate the proposed co-operative multiple-RSU based load balancing model significantly outperforms the non-load balancing multiple-RSU based VANETs model against a number of performance metrics.
{"title":"Co-Operative Load Balancing in Vehicular Ad Hoc Networks (VANETs)","authors":"G. Ali, E. Chan","doi":"10.4018/IJWNBT.2011100101","DOIUrl":"https://doi.org/10.4018/IJWNBT.2011100101","url":null,"abstract":"Recently data dissemination using Road Side Units RSUs in Vehicular Ad Hoc Networks VANETs received considerable attention for overcoming the vehicle to vehicle frequent disconnection problem. An RSU becomes overloaded due to its mounting location and/or during rush hour overload. As an RSU has short wireless transmission coverage range and vehicles are mobile, a heavily overloaded RSU may experience high deadline miss rate in effect of serving too many requests beyond its capacity. In this work, the authors propose a co-operative multiple-RSU model, which offers the opportunity to the RSUs with high volume workload to transfer some of its overloaded requests to other RSUs that have light workload and located in the direction in which the vehicle is heading. Moreover, for performing the load balancing, the authors propose three different heuristic load transfer approaches. By a series of simulation experiments, the authors demonstrate the proposed co-operative multiple-RSU based load balancing model significantly outperforms the non-load balancing multiple-RSU based VANETs model against a number of performance metrics.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121897133","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 : 2011-10-01DOI: 10.4018/ijwnbt.2011100102
Ming-Fong Tsai, N. Chilamkurti, Hsia-Hsin Li
Video streaming over vehicular networks is an attractive feature to many applications, such as emergency video transmission and inter-vehicle video transmission. Vehicles accessing road-side units have a few seconds to download information and experience a high packet loss rate. Hence, this paper proposes Cooperative Error Control CEC mechanism combining Cognitive Technology CT for video streaming over wireless vehicular networks. CEC mechanism combining CT uses a cooperative error recover scheme to recover lost packets not only from a road-side unit which uses the primary channel but also from the other vehicles using a free channel. Hence, CEC mechanism with CT can enhance error recovery performance and quality of video streaming over vehicular networks. Simulation results show the error recover performance of the CEC mechanism combining CT performs better than the other related mechanisms.
{"title":"Cooperative Error Control Mechanism Combining Cognitive Technology for Video Streaming Over Vehicular Networks","authors":"Ming-Fong Tsai, N. Chilamkurti, Hsia-Hsin Li","doi":"10.4018/ijwnbt.2011100102","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011100102","url":null,"abstract":"Video streaming over vehicular networks is an attractive feature to many applications, such as emergency video transmission and inter-vehicle video transmission. Vehicles accessing road-side units have a few seconds to download information and experience a high packet loss rate. Hence, this paper proposes Cooperative Error Control CEC mechanism combining Cognitive Technology CT for video streaming over wireless vehicular networks. CEC mechanism combining CT uses a cooperative error recover scheme to recover lost packets not only from a road-side unit which uses the primary channel but also from the other vehicles using a free channel. Hence, CEC mechanism with CT can enhance error recovery performance and quality of video streaming over vehicular networks. Simulation results show the error recover performance of the CEC mechanism combining CT performs better than the other related mechanisms.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122275761","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 : 2011-10-01DOI: 10.4018/ijwnbt.2011100103
F. Juraschek, M. Günes, B. Blywis
DES-Chan is a framework for experimentally driven research on distributed channel assignment algorithms in wireless mesh networks. DES-Chan eases the development process by providing a set of common services required by distributed channel assignment algorithms. A new challenge for channel assignment algorithms are sources of external interferences. With the increasing number of wireless devices in the unlicensed radio spectrum, co-located devices that share the same radio channel may have a severe impact on the network performance. DES-Chan provides a sensing component to detect such external devices and predict their future activity. As a proof of concept, the authors present a reference implementation of a distributed greedy channel assignment algorithm. The authors evaluate its performance in the DES-Testbed, a multi-transceiver wireless mesh network with 128 nodes at the Freie Universitat Berlin.
{"title":"A Framework for External Interference-Aware Distributed Channel Assignment","authors":"F. Juraschek, M. Günes, B. Blywis","doi":"10.4018/ijwnbt.2011100103","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011100103","url":null,"abstract":"DES-Chan is a framework for experimentally driven research on distributed channel assignment algorithms in wireless mesh networks. DES-Chan eases the development process by providing a set of common services required by distributed channel assignment algorithms. A new challenge for channel assignment algorithms are sources of external interferences. With the increasing number of wireless devices in the unlicensed radio spectrum, co-located devices that share the same radio channel may have a severe impact on the network performance. DES-Chan provides a sensing component to detect such external devices and predict their future activity. As a proof of concept, the authors present a reference implementation of a distributed greedy channel assignment algorithm. The authors evaluate its performance in the DES-Testbed, a multi-transceiver wireless mesh network with 128 nodes at the Freie Universitat Berlin.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126419450","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 : 2011-10-01DOI: 10.4018/ijwnbt.2011100104
M. Javed, J. Khan
Vehicular ad hoc networks VANETs are expected to be used for the dissemination of emergency warning messages on the roads. The emergency warning messages such as post crash warning notification would require an efficient multi hop broadcast scheme to notify all the vehicles within a particular area about the emergency. Such emergency warning applications have low delay and transmission overhead requirements to effectively transmit the emergency notification. In this paper, an adaptive distance based backoff scheme is presented for efficient dissemination of warning messages on the road. The proposed scheme adaptively selects the furthest vehicle as the next forwarder of the emergency message based on channel conditions. The detailed performance figures of the protocol are presented in the paper using simulations in the OPNET network simulator. The proposed protocol introduces lower packet delay and broadcast overhead as compared to standard packet broadcasting protocols for vehicular networks.
{"title":"An Efficient Data Dissemination Scheme for Warning Messages in Vehicular Ad Hoc Networks","authors":"M. Javed, J. Khan","doi":"10.4018/ijwnbt.2011100104","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011100104","url":null,"abstract":"Vehicular ad hoc networks VANETs are expected to be used for the dissemination of emergency warning messages on the roads. The emergency warning messages such as post crash warning notification would require an efficient multi hop broadcast scheme to notify all the vehicles within a particular area about the emergency. Such emergency warning applications have low delay and transmission overhead requirements to effectively transmit the emergency notification. In this paper, an adaptive distance based backoff scheme is presented for efficient dissemination of warning messages on the road. The proposed scheme adaptively selects the furthest vehicle as the next forwarder of the emergency message based on channel conditions. The detailed performance figures of the protocol are presented in the paper using simulations in the OPNET network simulator. The proposed protocol introduces lower packet delay and broadcast overhead as compared to standard packet broadcasting protocols for vehicular networks.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116737639","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 : 2011-07-01DOI: 10.4018/ijwnbt.2011070105
S. Ahuja, W. R. Shore
The performance of transport layer protocols can be affected differently due to wireless congestion, as opposed to network congestion. Using an active network evaluation strategy in a real world test-bed experiment, the Transport Control Protocol TCP, Datagram Congestion Control Protocol DCCP, and Stream Control Transport Protocol SCTP were evaluated to determine their effectiveness in terms of throughput, fairness, and smoothness. Though TCP's fairness was shown to suffer in wireless congestion, the results showed that it still outperforms the alternative protocols in both wireless congestion, and network congestion. In terms of smoothness, the TCP-like congestion control algorithm of DCCP did outperform TCP in wireless congestion, but at the expense of throughput and ensuing fairness. SCTP's congestion control algorithm was also found to provide better smoothness in wireless congestion. In fact, it provided smoother throughput performance than in the network congestion.
{"title":"Wireless Transport Layer Congestion Control Evaluation","authors":"S. Ahuja, W. R. Shore","doi":"10.4018/ijwnbt.2011070105","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011070105","url":null,"abstract":"The performance of transport layer protocols can be affected differently due to wireless congestion, as opposed to network congestion. Using an active network evaluation strategy in a real world test-bed experiment, the Transport Control Protocol TCP, Datagram Congestion Control Protocol DCCP, and Stream Control Transport Protocol SCTP were evaluated to determine their effectiveness in terms of throughput, fairness, and smoothness. Though TCP's fairness was shown to suffer in wireless congestion, the results showed that it still outperforms the alternative protocols in both wireless congestion, and network congestion. In terms of smoothness, the TCP-like congestion control algorithm of DCCP did outperform TCP in wireless congestion, but at the expense of throughput and ensuing fairness. SCTP's congestion control algorithm was also found to provide better smoothness in wireless congestion. In fact, it provided smoother throughput performance than in the network congestion.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918221","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 : 2011-07-01DOI: 10.4018/ijwnbt.2011070104
M. Brandl, A. Kos, K. Kellner, C. Mayerhofer, T. Posnicek, Christian Fabian
Wireless Sensor Networks WSNs are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric Pa gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm DSR. The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node's attractiveness metric.
{"title":"A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks","authors":"M. Brandl, A. Kos, K. Kellner, C. Mayerhofer, T. Posnicek, Christian Fabian","doi":"10.4018/ijwnbt.2011070104","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011070104","url":null,"abstract":"Wireless Sensor Networks WSNs are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric Pa gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm DSR. The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node's attractiveness metric.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117036204","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 : 2011-07-01DOI: 10.4018/ijwnbt.2011070102
Neeraj Kumar
The internet offers services for users which can be accessed in a collaborative shared manner. Users control these services, such as online gaming and social networking sites, with handheld devices. Wireless mesh networks WMNs are an emerging technology that can provide these services in an efficient manner. Because services are used by many users simultaneously, security is a paramount concern. Although many security solutions exist, they are not sufficient. None have considered the concept of load balancing with secure communication for online services. In this paper, a load aware multiparty secure group communication for online services in WMNs is proposed. During the registration process of a new client in the network, the Load Balancing Index LBI is checked by the router before issuing a certificate/key. The certificate is issued only if the value of LBI is less than a predefined threshold. The authors evaluate the proposed solution against the existing schemes with respect to metrics like storage and computation overhead, packet delivery fraction PDF, and throughput. The results show that the proposed scheme is better with respect to these metrics.
{"title":"Load Balancing Aware Multiparty Secure Group Communication for Online Services in Wireless Mesh Networks","authors":"Neeraj Kumar","doi":"10.4018/ijwnbt.2011070102","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011070102","url":null,"abstract":"The internet offers services for users which can be accessed in a collaborative shared manner. Users control these services, such as online gaming and social networking sites, with handheld devices. Wireless mesh networks WMNs are an emerging technology that can provide these services in an efficient manner. Because services are used by many users simultaneously, security is a paramount concern. Although many security solutions exist, they are not sufficient. None have considered the concept of load balancing with secure communication for online services. In this paper, a load aware multiparty secure group communication for online services in WMNs is proposed. During the registration process of a new client in the network, the Load Balancing Index LBI is checked by the router before issuing a certificate/key. The certificate is issued only if the value of LBI is less than a predefined threshold. The authors evaluate the proposed solution against the existing schemes with respect to metrics like storage and computation overhead, packet delivery fraction PDF, and throughput. The results show that the proposed scheme is better with respect to these metrics.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115646905","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 : 2011-07-01DOI: 10.4018/ijwnbt.2011070103
S. Fowler, M. Eberhard, K. Blow, A. Shaikh
Wireless Mesh Networks WMNs have emerged as a key technology for the next generation of wireless networking. Instead of being another type of ad-hoc networking, WMNs diversify the capabilities of ad-hoc networks. Several protocols that work over WMNs include IEEE 802.11a/b/g, 802.15, 802.16 and LTE-Advanced. To bring about a high throughput under varying conditions, these protocols have to adapt their transmission rate. This paper proposes a scheme to improve channel conditions by performing rate adaptation along with multiple packet transmission using packet loss and physical layer condition. Dynamic monitoring, multiple packet transmission and adaptation to changes in channel quality by adjusting the packet transmission rates according to certain optimization criteria provided greater throughput. The key feature of the proposed method is the combination of the following two factors: 1 detection of intrinsic channel conditions by measuring the fluctuation of noise to signal ratio via the standard deviation, and 2 the detection of packet loss induced through congestion. The authors show that the use of such techniques in a WMN can significantly improve performance in terms of the packet sending rate. The effectiveness of the proposed method was demonstrated in a simulated wireless network testbed via packet-level simulation.
{"title":"Adaptive Sending Rate Over Wireless Mesh Networks Using SNR","authors":"S. Fowler, M. Eberhard, K. Blow, A. Shaikh","doi":"10.4018/ijwnbt.2011070103","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011070103","url":null,"abstract":"Wireless Mesh Networks WMNs have emerged as a key technology for the next generation of wireless networking. Instead of being another type of ad-hoc networking, WMNs diversify the capabilities of ad-hoc networks. Several protocols that work over WMNs include IEEE 802.11a/b/g, 802.15, 802.16 and LTE-Advanced. To bring about a high throughput under varying conditions, these protocols have to adapt their transmission rate. This paper proposes a scheme to improve channel conditions by performing rate adaptation along with multiple packet transmission using packet loss and physical layer condition. Dynamic monitoring, multiple packet transmission and adaptation to changes in channel quality by adjusting the packet transmission rates according to certain optimization criteria provided greater throughput. The key feature of the proposed method is the combination of the following two factors: 1 detection of intrinsic channel conditions by measuring the fluctuation of noise to signal ratio via the standard deviation, and 2 the detection of packet loss induced through congestion. The authors show that the use of such techniques in a WMN can significantly improve performance in terms of the packet sending rate. The effectiveness of the proposed method was demonstrated in a simulated wireless network testbed via packet-level simulation.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125563411","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
扫码关注我们
求助内容：
应助结果提醒方式：