Bhaskar Bhuyan, H. Sarma, N. Sarma, A. Kar, R. Mall
Wireless sensor networks (WSNs) are required to provide different levels of Quality of Services (QoS) based on the type of applications. Providing QoS support in wireless sensor networks is an emerging area of research. Due to resource constraints like processing power, memory, bandwidth and power sources in sensor networks, QoS support in WSNs is a challenging task. In this paper, we discuss the QoS requirements in WSNs and present a survey of some of the QoS aware routing techniques in WSNs. We also explore the middleware approaches for QoS support in WSNs and finally, highlight some open issues and future direction of research for providing QoS in WSNs.
{"title":"Quality of Service (QoS) Provisions in Wireless Sensor Networks and Related Challenges","authors":"Bhaskar Bhuyan, H. Sarma, N. Sarma, A. Kar, R. Mall","doi":"10.4236/wsn.2010.211104","DOIUrl":"https://doi.org/10.4236/wsn.2010.211104","url":null,"abstract":"Wireless sensor networks (WSNs) are required to provide different levels of Quality of Services (QoS) based on the type of applications. Providing QoS support in wireless sensor networks is an emerging area of research. Due to resource constraints like processing power, memory, bandwidth and power sources in sensor networks, QoS support in WSNs is a challenging task. In this paper, we discuss the QoS requirements in WSNs and present a survey of some of the QoS aware routing techniques in WSNs. We also explore the middleware approaches for QoS support in WSNs and finally, highlight some open issues and future direction of research for providing QoS in WSNs.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123754079","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}
Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and AoA to estimate the distance between two nodes. Proximity sensing between nodes is typically the basis for range-free algorithms. A tradeoff exists since range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is very important. In this paper, we propose a new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining. It requires selection of the K-nearest neighbours (KNN). DBOD assigns density values to each point used in the location estimation. The mean of these densities is calculated and those points having a density larger than the mean are kept as candidate points. Different performance measures are used to compare our approach with the linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD) algorithms. It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.
{"title":"Range-Based Localization in Wireless Networks Using Density-Based Outlier Detection","authors":"Khalid K. Almuzaini, T. Gulliver","doi":"10.4236/wsn.2010.211097","DOIUrl":"https://doi.org/10.4236/wsn.2010.211097","url":null,"abstract":"Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and AoA to estimate the distance between two nodes. Proximity sensing between nodes is typically the basis for range-free algorithms. A tradeoff exists since range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is very important. In this paper, we propose a new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining. It requires selection of the K-nearest neighbours (KNN). DBOD assigns density values to each point used in the location estimation. The mean of these densities is calculated and those points having a density larger than the mean are kept as candidate points. Different performance measures are used to compare our approach with the linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD) algorithms. It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126478134","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}
Wavelet packets decompose signals in to broader components using linear spectral bisecting. Mixing matrix is the key issue in the Blind Source Separation (BSS) literature especially in under-determined cases. In this paper, we propose a simple and novel method in Short Time Wavelet Packet (STWP) analysis to estimate blindly the mixing matrix of speech signals from noise free linear mixtures in over-complete cases. In this paper, the Laplacian model is considered in short time-wavelet packets and is applied to each histogram of packets. Expectation Maximization (EM) algorithm is used to train the model and calculate the model parameters. In our simulations, comparison with the other recent results will be computed and it is shown that our results are better than others. It is shown that complexity of computation of model is decreased and consequently the speed of convergence is increased.
{"title":"Underdetermined Blind Mixing Matrix Estimation Using STWP Analysis for Speech Source Signals","authors":"B. M. Tazehkand, M. Tinati","doi":"10.4236/wsn.2010.211103","DOIUrl":"https://doi.org/10.4236/wsn.2010.211103","url":null,"abstract":"Wavelet packets decompose signals in to broader components using linear spectral bisecting. Mixing matrix is the key issue in the Blind Source Separation (BSS) literature especially in under-determined cases. In this paper, we propose a simple and novel method in Short Time Wavelet Packet (STWP) analysis to estimate blindly the mixing matrix of speech signals from noise free linear mixtures in over-complete cases. In this paper, the Laplacian model is considered in short time-wavelet packets and is applied to each histogram of packets. Expectation Maximization (EM) algorithm is used to train the model and calculate the model parameters. In our simulations, comparison with the other recent results will be computed and it is shown that our results are better than others. It is shown that complexity of computation of model is decreased and consequently the speed of convergence is increased.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121886108","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}
The interference reduction capability of antenna arrays and the power control algorithms have been considered separately as means to decrease the interference in wireless communication networks. In this paper, we propose smart step closed-loop power control (SSPC) algorithm in wireless networks in a 2D urban environment with constrained least mean squared (CLMS) algorithm. This algorithm is capable of efficiently adapting according to the environment and able to permanently maintain the chosen frequency response in the look direction while minimizing the output power of the array. Also, we present switched-beam (SB) technique for enhancing signal to interference plus noise ratio (SINR) in wireless networks. Also, we study an analytical approach for the evaluation of the impact of power control error (PCE) on wireless networks in a 2D urban environment. The simulation results indicate that the convergence speed of the SSPC algorithm is faster than other algorithms. Also, we observe that significant saving in total transmit power (TTP) are possible with our proposed algorithm. Finally, we discuss three parameters of the PCE, number of antenna elements, and path-loss exponent and their effects on capacity of the system via some computer simulations.
{"title":"Joint Closed-Loop Power Control and Adaptive Beamforming for Wireless Networks with Antenna Arrays in a 2D Urban Environment","authors":"M. D. Moghadam, H. Bakhshi, G. Dadashzadeh","doi":"10.4236/wsn.2010.211105","DOIUrl":"https://doi.org/10.4236/wsn.2010.211105","url":null,"abstract":"The interference reduction capability of antenna arrays and the power control algorithms have been considered separately as means to decrease the interference in wireless communication networks. In this paper, we propose smart step closed-loop power control (SSPC) algorithm in wireless networks in a 2D urban environment with constrained least mean squared (CLMS) algorithm. This algorithm is capable of efficiently adapting according to the environment and able to permanently maintain the chosen frequency response in the look direction while minimizing the output power of the array. Also, we present switched-beam (SB) technique for enhancing signal to interference plus noise ratio (SINR) in wireless networks. Also, we study an analytical approach for the evaluation of the impact of power control error (PCE) on wireless networks in a 2D urban environment. The simulation results indicate that the convergence speed of the SSPC algorithm is faster than other algorithms. Also, we observe that significant saving in total transmit power (TTP) are possible with our proposed algorithm. Finally, we discuss three parameters of the PCE, number of antenna elements, and path-loss exponent and their effects on capacity of the system via some computer simulations.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122281652","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}
Considering the environmental protection, forest fire becomes a more and more serious problem and requires more concerns. This paper provides an efficient method for fire monitoring and detection in forests using wireless sensor network technology. The proposed technique estimates the location of a sensor node based on the current set of hop-count values, which are collected through the anchor nodes’ broadcast. Our algorithm incorporates two salient features; grid-based output and event-triggering mechanism, to improve the accuracy while reducing the power consumption. Through the computer simulation, the output region obtained from our algorithm can always cover the target node. In addition, the algorithm was implemented and tested with a set of Crossbow sensors. Experimental results demonstrated the high feasibility and worked well in real environment.
{"title":"3-D Grid-Based Localization Technique in Mobile Sensor Networks","authors":"Jia Li, Lei Sun, Wai Yee Leong, P. Chong","doi":"10.4236/wsn.2010.211100","DOIUrl":"https://doi.org/10.4236/wsn.2010.211100","url":null,"abstract":"Considering the environmental protection, forest fire becomes a more and more serious problem and requires more concerns. This paper provides an efficient method for fire monitoring and detection in forests using wireless sensor network technology. The proposed technique estimates the location of a sensor node based on the current set of hop-count values, which are collected through the anchor nodes’ broadcast. Our algorithm incorporates two salient features; grid-based output and event-triggering mechanism, to improve the accuracy while reducing the power consumption. Through the computer simulation, the output region obtained from our algorithm can always cover the target node. In addition, the algorithm was implemented and tested with a set of Crossbow sensors. Experimental results demonstrated the high feasibility and worked well in real environment.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125225652","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}
Real vehicle tracking data play an important role in the research of routing in vehicle sensor networks. Most of the vehicle tracking data, however, were collected periodically and could not meet the requirements of real-time by many applications. Most of the existing trace interpolation algorithms use uniform interpolation methods and have low accuracy problem. From our observation, intersection vehicle status is critical to the vehicle movement. In this paper, we proposed a novel trace interpolation algorithm. Our algorithm used intersection vehicle movement modeling (IVMM) and velocity data mining (VDM) to assist the interpolation process. The algorithm is evaluated with real vehicle GPS data. Results show that our algorithm has much higher accuracy than traditional trace interpolation algorithms.
{"title":"Trace Interpolation Algorithm Based on Intersection Vehicle Movement Modeling","authors":"Jinwei Shen, Guangtao Xue","doi":"10.4236/wsn.2010.211099","DOIUrl":"https://doi.org/10.4236/wsn.2010.211099","url":null,"abstract":"Real vehicle tracking data play an important role in the research of routing in vehicle sensor networks. Most of the vehicle tracking data, however, were collected periodically and could not meet the requirements of real-time by many applications. Most of the existing trace interpolation algorithms use uniform interpolation methods and have low accuracy problem. From our observation, intersection vehicle status is critical to the vehicle movement. In this paper, we proposed a novel trace interpolation algorithm. Our algorithm used intersection vehicle movement modeling (IVMM) and velocity data mining (VDM) to assist the interpolation process. The algorithm is evaluated with real vehicle GPS data. Results show that our algorithm has much higher accuracy than traditional trace interpolation algorithms.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117026369","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}
Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.
{"title":"BEAR: A Balanced Energy-Aware Routing Protocol for Wireless Sensor Networks","authors":"E. Ahvar, M. Fathy","doi":"10.4236/wsn.2010.210095","DOIUrl":"https://doi.org/10.4236/wsn.2010.210095","url":null,"abstract":"Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129115986","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}
Due to their easy-to-deploy and self-healing features, WMNs (Wireless Mesh Networks) are emerging as a new promising technology with a rich set of applications. While the IEEE standardization of this new technology is still in progress, its main traits are already set, e.g., architecture and MAC routing. WMNs are attracting considerable research in academia and industry as well, but the lack of open-source testbeds is restricting such a research to simulation tools. The main problem with simulation tools is that they do not reflect the complexity of RF propagation, especially in indoor environments, of which IEEE 802.11s WMNs are an example. This paper presents an open-source implementation of an indoor IEEE 802.11s WMN testbed. The implementation is transparent, easy-to-deploy, and both the source code and deployment instructions are available online. The implementation can serve as a blueprint for the WMN research community to deploy their own testbeds, negating the shortcomings of using simulation tools. By delving into the testbed implementation subtleties, this paper is shedding further light on the details of the ongoing IEEE 802.11s standard. Major encountered implementation problems (e.g., clients association, Internetworking, and supporting multiple gateways) are identified and addressed. To ascertain the functionality of the testbed, both UDP and TCP traffic are supported and operational. The testbed uses the default IEEE 802.11s HWMP (Hybrid Wireless Mesh Protocol) routing protocol along with the default IEEE 802.11s Airtime routing metric.
{"title":"IEEE 802.11s Wireless Mesh Networks for Last-Mile Internet Access: An Open-Source Real-World Indoor Testbed Implementation","authors":"M. Abid, Taha Ben Brahim, S. Biaz","doi":"10.4236/wsn.2010.210088","DOIUrl":"https://doi.org/10.4236/wsn.2010.210088","url":null,"abstract":"Due to their easy-to-deploy and self-healing features, WMNs (Wireless Mesh Networks) are emerging as a new promising technology with a rich set of applications. While the IEEE standardization of this new technology is still in progress, its main traits are already set, e.g., architecture and MAC routing. WMNs are attracting considerable research in academia and industry as well, but the lack of open-source testbeds is restricting such a research to simulation tools. The main problem with simulation tools is that they do not reflect the complexity of RF propagation, especially in indoor environments, of which IEEE 802.11s WMNs are an example. This paper presents an open-source implementation of an indoor IEEE 802.11s WMN testbed. The implementation is transparent, easy-to-deploy, and both the source code and deployment instructions are available online. The implementation can serve as a blueprint for the WMN research community to deploy their own testbeds, negating the shortcomings of using simulation tools. By delving into the testbed implementation subtleties, this paper is shedding further light on the details of the ongoing IEEE 802.11s standard. Major encountered implementation problems (e.g., clients association, Internetworking, and supporting multiple gateways) are identified and addressed. To ascertain the functionality of the testbed, both UDP and TCP traffic are supported and operational. The testbed uses the default IEEE 802.11s HWMP (Hybrid Wireless Mesh Protocol) routing protocol along with the default IEEE 802.11s Airtime routing metric.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955353","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}
Topology-transparent MAC scheduling strategies nowadays are all based on combinatorial design. To get throughput guarantee, a cover-free set is output as scheduling strategy of network. In this paper, we aim to modify the cover-free set so that better throughput can be guaranteed. At the first step, the redundant slot of the cover-free set is proposed and found to have negative influence on the minimal guaranteed throughput. Second, we prove that any subset of a cover-free set is still a cover-free set after its redundant slots were squashed out. Our algorithm chooses the subset which has the maximal number of redundant slots, squashes all of its redundant slots, and then designates it as the network scheduling strategy. Therefore, better through- put can be guaranteed if the squashed subset is adopted as network scheduling strategy. For any topology- transparent node scheduling strategy, both the increased minimal throughput and decreased maximal transmission delay can be gotten by just using our algorithm as an extra accessory.
{"title":"An Algorithm for Improving Throughput Guarantee of Topology-Transparent MAC Scheduling Strategy","authors":"Chaonong Xu","doi":"10.4236/wsn.2010.210096","DOIUrl":"https://doi.org/10.4236/wsn.2010.210096","url":null,"abstract":"Topology-transparent MAC scheduling strategies nowadays are all based on combinatorial design. To get throughput guarantee, a cover-free set is output as scheduling strategy of network. In this paper, we aim to modify the cover-free set so that better throughput can be guaranteed. At the first step, the redundant slot of the cover-free set is proposed and found to have negative influence on the minimal guaranteed throughput. Second, we prove that any subset of a cover-free set is still a cover-free set after its redundant slots were squashed out. Our algorithm chooses the subset which has the maximal number of redundant slots, squashes all of its redundant slots, and then designates it as the network scheduling strategy. Therefore, better through- put can be guaranteed if the squashed subset is adopted as network scheduling strategy. For any topology- transparent node scheduling strategy, both the increased minimal throughput and decreased maximal transmission delay can be gotten by just using our algorithm as an extra accessory.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127804699","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}
Wireless sensor networks (WSNs) are energy-constrained networks. The residual energy real-time monitoring (RERM) is very important for WSNs. Moreover, network model is an important foundation of RERM research at personal area network (PAN) level. Because RERM is inherently application-oriented, the network model adopted should also be application-oriented. However, many factors of WSNs applications such as link selected probability and ACK mechanism etc. were neglected by current network models. These factors can introduce obvious influence on throughput of WSNs. Then the energy consumption of nodes will be influenced greatly. So these models cannot characterize many real properties of WSNs, and the result of RERM is not consistent with the real-world situation. In this study, these factors neglected by other researchers are taken into account. Furthermore, an application-oriented general network model (AGNM) for RERM is proposed. Based on the AGNM, the dynamic characteristics of WSNs are simulated. The experimental results show that AGNM can approximately characterize the real situation of WSNs. Therefore, the AGNM provides a good foundation for RERM research.
{"title":"An Application-Oriented Network Model for Wireless Sensor Networks","authors":"Xiaoliang Cheng, Zhidong Deng, Zhen Huang","doi":"10.4236/wsn.2010.210090","DOIUrl":"https://doi.org/10.4236/wsn.2010.210090","url":null,"abstract":"Wireless sensor networks (WSNs) are energy-constrained networks. The residual energy real-time monitoring (RERM) is very important for WSNs. Moreover, network model is an important foundation of RERM research at personal area network (PAN) level. Because RERM is inherently application-oriented, the network model adopted should also be application-oriented. However, many factors of WSNs applications such as link selected probability and ACK mechanism etc. were neglected by current network models. These factors can introduce obvious influence on throughput of WSNs. Then the energy consumption of nodes will be influenced greatly. So these models cannot characterize many real properties of WSNs, and the result of RERM is not consistent with the real-world situation. In this study, these factors neglected by other researchers are taken into account. Furthermore, an application-oriented general network model (AGNM) for RERM is proposed. Based on the AGNM, the dynamic characteristics of WSNs are simulated. The experimental results show that AGNM can approximately characterize the real situation of WSNs. Therefore, the AGNM provides a good foundation for RERM research.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418151","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
扫码关注我们
求助内容：
应助结果提醒方式：