QoS Guaranteed Causal Ordering Group Communication for Cognitive Radio Ad Hoc Networks

详细信息    查看全文

• 作者：Kunxiao Zhou ; Liming Xie ; Xiaohua Jia
• 关键词：Causal ordering ; Group communication ; Slot assignment ; QoS ; Cognitive radio networks
• 刊名：Wireless Personal Communications
• 出版年：2016
• 出版时间：February 2016
• 年：2016
• 卷：86
• 期：3
• 页码：1447-1465
• 全文大小：886 KB
• 参考文献：1.Akyildiz, I. F., Lee, W.-Y., Vuran, M. C., & Mohanty, S. (2006). NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks (Elsevier), 50, 2127–2159.CrossRef MATH
  2.Gregory, V. C., Idit, K., & Roman, V. (2001). Group communication specification: A comprehesive study. ACM Comptuing Surveys, 33(4), 427–469.CrossRef
  3.Schiper, A. (2006). Dynamic group communication. Distributed Computing, 18(5), 359–374.CrossRef MATH
  4.Wang, X., Cao, J., Cheng, H., & Huang, M. (2006). QoS multicast routing for multimedia group communications using intelligent computational methods. Computer Communications (Elsvier), 29(12), 2217–2229.CrossRef
  5.Jia, X., & Wang, L. (1997). A group multicast routing algorithm by using multiple minimum Steiner trees. Computer Communications (Elsevier), 20(9), 750–758.CrossRef
  6.Jia, X. (1995). A total ordering multicast protocol using propagation trees. IEEE Transactions on Parallel and Distributed Systems, 6(6), 617–627.CrossRef
  7.Birman, K., & Joseph, T. A. (1987). Reliable communication in the presence of failures. ACM Transactions on Computer Systems (TOCS), 5(1), 47–76.CrossRef
  8.Hadzilacos, V., & Toueg, S. (May 1994). A modular approach to the specification and implementation of fault-tolerant broadcasts, Technical Report TR94-1425. Department of Computer Science, Cornell University, Ithaca, NY.
  9.Alagar, S., & Venkatesan, S. (1997). Causal ordering in distributed mobile systems. IEEE Transactions on Computers, 46(3), 353–361.CrossRef
  10.Schiper, A., Eggli, J., & Sandoz, A. (Sep. 1989). A new algorithm to implement causal ordering. In Proceedings of the third international workshop on distributed algorithms (pp. 219–232).
  11.Prakash, R., Raynal, M., & Singhal, M. (1996). An efficient causal ordering algorithm for mobile computing environments. In Proceedings of 16th international conference on distributed computing systems (ICDCS) (pp. 744–751).
  12.Cai, W., Lee, B.-S., & Zhou, J. (2002). Causal order delivery in a multicast environment: An improved algorithm. Journal of Parallel and Distributed Computing, 62(1), 111–131.CrossRef MATH
  13.Sun, C., Jia, X., Zhang, Y., Yang, Y., & Chen, D. (1998). Achieving convergency, causality-preservation and intention preservation in real-time cooperative editing systems. ACM Transactions on Computer-Human Interaction, 5, 63–108.CrossRef
  14.Aiello, R., Pagani, E., & Rossi, G. P. (1993). Causal ordering in reliable group communications. Computer Communication Review, 23(4), 106–115.CrossRef
  15.Nakamura, A., & Takizawa, M. (Jun 1994). Causally ordering broadcast protocol. In Proceedings of the 14th international conference on distributed computing systems (pp. 48–55).
  16.Dolev, D., Kramer, S., & Malki, D. (Jun 1993). Early delivery totally ordered multicast in asynchronous environments. In Proceeding of the 23th international symposium on fault-tolerant computing (pp. 544–553).
  17.Hsiao, C.-M., & Liao, Y.-P. (February 2011). Domain-based causal ordering group communication in wireless hybrid networks. In ACM proceedings of the 5th international conference on ubiquitous information management and communication (ICUIMC’11).
  18.Duolikun D., Aikebaier A., Enokido T., & Takizawa M. (Sept. 2012). Ordered delivery of messages in group communication protocols.Network-based information systems (NBiS), 2012 15th international conference on (pp. 397–401).
  19.Kim, C., & Ahn, J. (2012). A novel approach to guarantee causal message ordering in pre-planned wireless sensor networks. Algorithms and Architectures for Parallel Processing, 7440, 300–309.CrossRef
  20.Xin, C., Xie, B., & Shen, C.-C. (Nov. 2005). A novel layered graph model for topology formation and routing in dynamic spectrum access networks. In Proceedings of IEEE DySPAN (pp. 308–317).
  21.Hincapie, R., Tang, J., Xue, G., & Bustamante, R. (Dec. 2008). QoS routing in wireless mesh networks with cognitive radios. In Proceedings of IEEE Globecom (pp. 1–5).
  22.Jia, J., Zhang, J., & Zhang, Q. (2009). Relay-assisted routing in cognitive radio networks. In Proceedings of IEEE ICC (pp. 1–5).
  23.Cheng, G., Liu, W., Li, Y., & Cheng, W. (June 2007). Joint on-demand routing and spectrum assignment in cognitive radio networks. In Proceedings of IEEE ICC (pp. 6499–6503).
  24.Pal, R. (April 2007). Efficient routing algorithms for multi-channel dynamic spectrum access networks. In Proceedings of IEEE DySPAN (pp. 288–291).
  25.Krishnamurthy, S., Thoppian, M., Venkatesan, S., & Prakash, R. (Oct. 2005). Control channel based MAC-layer configuration, routing and situation awareness for cognitive radio networks. In Proceedings of IEEE Milcom (pp. 455–460).
  26.Xie, L., & Jia, X. (Dec. 2010). QoS multicast routing and transmission scheduling in multi-hop cognitive radio networks. In Proceediings of the GLOBECOM 2010 workshop on pervasive group communication.
  27.Brandon, F. L. (2011). A survey of common control channel design in cognitive radio networks. Physical Communication(ACM), 4(1), 26–39.MathSciNet
  28.Tarjan, R. E. (1983). Data structures and network algorithms. Society for Industrial and Applied Mathematics.
  29.Ballardie, T., Francis, P., & Crowcroft, J. (Oct. 1993). Core based tree. In Proceedings of ACM SIGCOMM’ 93 (pp. 85–95). Sail Francisco, CA.
  30.Wu, H., & Jia, X. (2007). QoS multicast routing by using multiple paths/trees in wireless ad hoc networks. Ad Hoc Networks (Elsevier), 5(5), 600–614.CrossRef
  
• 作者单位：Kunxiao Zhou (1) (2)
  Liming Xie (2)
  Xiaohua Jia (2)
  
  1. Computer School, Dongguan University of Technology, Guangdong, China
  2. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
  
• 刊物类别：Engineering
• 刊物主题：Electronic and Computer Engineering
  Signal,Image and Speech Processing
  Processor Architectures
  
• 出版者：Springer Netherlands
• ISSN：1572-834X

文摘

In this paper, we discuss the QoS guaranteed causal ordering group communication for cognitive radio (CR) ad hoc networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the transport layer and the methods in the works incurred high communication overhead and the long latency for message delivery. In this paper, we discuss the causal ordering at the network layer. The problem of our concern is: given a QoS group communication request in a CR ad hoc network, how to set up the connection so that the causal ordering of the group communication can be preserved, and the bandwidth consumption of the communication is minimized under the condition that the QoS requirement is satisfied. In this paper, we focus on the bandwidth requirement. We propose a two-phase method to solve the problem. In the method, we first construct a multicast tree for the communication, and then assign slots for all tree links. It is proved that the method can preserve the causal ordering of messages without extra communication overhead nor the latency for delivering messages. Simulations are conducted to show the performance of our proposed method.