CSA  >> Vol. 7 No. 8 (August 2017)

    A Competing Metric Balancing Mechanism for Routing in Wireless Sensor Network

  • 全文下载: PDF(854KB) HTML   XML   PP.729-737   DOI: 10.12677/CSA.2017.78084  
  • 下载量: 216  浏览量: 304   国家自然科学基金支持


罗 恒:苏州科技大学江苏省建筑智慧节能重点实验室,江苏 苏州;苏州科技大学苏州市移动网络技术与应用重点实验室,江苏 苏州;
邹优敏,郁志豪:苏州科技大学苏州市移动网络技术与应用重点实验室,江苏 苏州

无线传感网多参数均衡路由机制模糊逻辑Wireless Sensor Network Multi-Parameter Balancing Routing Fuzzy Logics



Wireless Sensor Network (WSN) is capable of measuring parameters within its coverage area. It gains wide applications in the areas such as military fields, environment monitoring for the sake of safety, efficiency as well as on-time nature. Nevertheless, factors such as time dependent nature of wireless links, dynamic topology make it different for proliferation of wireless sensor network. Routing is a key but the most difficult part in the design as well as optimization of wireless sensor networks. Specific speaking, routing in WSN is designed to improve one or at most two performance metrics, leading to its performance deterioration when the application fields change. An adaptive routing mechanism based on GRC, with five metrics considered, is proposed, targeting at multiple parameters such as packet delivery ratio, delay, jitter, throughput and energy cost evaluation, in this paper to rank the alternative protocols and thus rank them accordingly using fuzzy logics. Competing metrics are balanced and therefore our method is able to obtain the optimal routing algorithm. Simulation results show that a 32% gain may be achieved by using the proposed method in terms of middle traffic flow. Our method is able to provide a quantitative method for performance evaluation for wireless sensor network. It also aims at providing benchmark for algorithm optimization.

罗恒, 邹优敏, 陆家欣, 郁志豪. 无线传感网多参数路由均衡机制研究[J]. 计算机科学与应用, 2017, 7(8): 729-737. https://doi.org/10.12677/CSA.2017.78084


[1] Perkins, C.E. and Bhagwat, P. (1994) Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. ACM SIGCOMM Computer Communication Review. ACM, 24, 234-244.
[2] Johnson, D.B., Maltz, D.A. and Broch, J. (2001) DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless ad Hoc Networks. Ad Hoc Networking, 5, 139-172.
[3] Perkins, C., Belding-Royer, E. and Das, S. (2003) Request for Comments: Ad Hoc On-Demand Distance Vector (AODV) Routing. Experimental Internet Society, 6, 90-98.
[4] Cho, T.K. and Lee, J.H. (2011) The Study on the OLSR (Optimized Link State Routing Protocol) Implementation in the Mobile Ad-hoc Network. International Journal of Bifurcation & Chao, 60, 67-80.
[5] Lego, K.P., et al. (2010) Comparative Study of Ad Hoc Routing Protocol AODV, DSR and DSDV in Mobile Ad Hoc Network. Indian Journal of Computer Science and Engineering, 1, 364-371.
[6] Lawrence, E.E. and Latha, D.R. (2014) A Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks. International Journal of Computer Science & Mobile Computing, 3, 46-53.
[7] Broch, J., Maltz, D.A., Johnson, D.B., et al. (1998) A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking. ACM, 85-97.
[8] The Network Simulator: ns-2.
[9] Xu, Z. (2000) On Consistency of the Weighted Geometric Mean Complex Judgement Matrix in AHP. European Journal of Operational Research, 126, 683-687.