Layerless Design of A Power-efficient Clustering Algorithm for Wireless Ad Hoc Networks under Fading
Tóm tắt
Traditional wireless ad hoc network power-efficient design proceeds separately on access and clustering algorithms by assuming perfect distance (that is, no fading and channel impairments) at most. In this paper, we discard the traditional layer-concept to tackle this important power-efficient wireless ad hoc networks under shadow fading, by identifying distance between a node pair as a sort of random distance to accommodate fading effect, which of course can be considered as a cross-layer design from traditional concept. By deriving the probability distribution of the distance between two nodes and the probability distribution of the distances between nodes and a randomly selected common reference node, the impacts of shadow fading on the link connectivity and node degree of the randomly constructed network topology are studied. Next, we propose a critical node first (CNF) based clustering algorithm to organize such a shadow faded random network topology into a power-efficient network architecture. By taking the shadow fading effects into considerations, our results show that the cluster-based network architecture generated by the proposed CNF-based clustering algorithm is power-efficient since the required number of exchanges of the cluster maintenance overheads is reduced.
Tài liệu tham khảo
Weiser, M. (1991). The computer for the 21st century. Scientific American, 265(3).
Frodigh M., Johansson P., Larsson P. (2000). Wireless ad hoc networking: the art of networking without a network. Ericsson Review 4:248–263
Sun J.Z. (2001). Mobile ad hoc networking: An essential technology for pervasive computing. Proceedings of International Conferences on Info-tech & Info-net (ICII) 3:316–321
Das B., Bhargavan V. (1997). Routing in ad-hoc networks using minimum connected dominating sets. Proceedings of IEEE ICC 97:376–380
Wu, J., & Li, H. L. (1999). On calculating connected dominating set for efficient routing in ad hoc wireless networks. ACM Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14.
Garey, M. R., & Johnson, D. S. (1978). Computers and intractability: A guide to the theory of NP-Completeness. Freeman, San Francisco.
Li C.S. (1985). Clustering in packet radio networks. IEEE ICC 85:283–287
Gerla M., Tsai J.T.C. (1995). Multicluster, mobile, multimedia radio network. ACM/Baltzer Journal on Wireless Networks 1:255–265
Lin C.H., Gerla M. (1997). Adaptive clustering for mobile wireless networks. IEEE Journal of Selected Areas Communiction 15(7):1265–1275
Baker D.J., Ephremides A. (1981). The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications COM-29(11):1694–1701
Shah, M. J., & Flikkema, P. G. (1999). Power-based leader selection in ad-hoc wireless networks. IEEE International Performance, Computing and Communications Conference, 134–139.
Singh, S., & Kurose, J. (1991). Electing leaders based upon performance: The delay model. IEEE International Conference on Distributed Computing, 464–471.
Basagni, S. (1999). Distributed clustering for ad hoc networks. Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN’99), 310–315.
McDonald A.B., Znati T.F. (1999). A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE Journal of Selected Areas Communications 17:1466–1487
Yu J.Y., Chong H.J.P. (2005). A survey of clustering schemes for mobile ad hoc networks. IEEE Communications Survey and Tutorials First Quarter 2005 7(1):32–48
Awerbuch B., Peleg D. (1990). Sparse partitions. Proceedings of the 31st Annual Symposium on Foundations of Computer Science 2:503–513
Peleg D., Upfal E. (1989). A trade-off between space and efficiency for routing tables. Journal of the ACM 36(3):510–530
Ramamoorthy C.V., Bhide A., Srivastava J. (1987). Reliable clustering techniques for large, mobile packet radio networks. Proceedings of IEEE INFOCOM’ 87:218–226
Baker D.J., Ephremides A., Flynn J.A. (1984). The design and simulation of a mobile radio network with distributed control. IEEE Journal of Selected Areas Communication SAC-2:226–237
Hou T.-C., Tsai T.J. (2001). An access-based clustering protocol for multihop wireless ad hoc networks. IEEE Journal of Selected Areas Communication 19(7):1201–1210
Srivastava V., Motani M. (2005). Cross-layer design: a survey and the road ahead. IEEE Communication Magazine 43(12):112–119
Kawadia V., Kumar P.R. (2005). A cautionary perspective on cross layer design. IEEE Wireless Communications 12(1):3–11
Shakkottai S., Rappaport T.S., Karlsson P.C. (2003). Cross-layer design for wireless networks. IEEE Communication Magazine 41(10):74–80
Raisinghani V.T., Iyer S. (2004). Cross-layer design optimizations in wireless protocol stacks. Computer Communication 27(8):720–724
Buratti C., Giorgetti A., Verdone R. (2005). Cross-layer design of an energy-efficient cluster formation algorithm with carrier-sensing multiple access for wireless sensor networks. EURASIP Journal on Wireless Communications and Networking 5(5):672–685
Wang L.C., Wang C.W. (2004). A cross-layer design of clustering architecture for wireless sensor networks. In Proceedings of IEEE International Conference on Networking, Sensing and Controll (ICNSC’04) 1:547–552
Berberian, S. K. (1999). Fundamentals of Real Analysis. Springer.
Xue F., Kumar P.R. (2004). The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10(2):169–181
Hekmat R., Van Mieghem P. (2003). Degree distribution and hopcount in wireless ad-hoc networks. Proceedings of IEEE ICON’03:603–609
Bettstetter C. (2002). On the minimum node degree and connectivity of a wireless multihop network. ACM MobiHoc’02:80–91
Ferrari G., Tonguz O.K. (2004). Minimum number of neighbors for fully connected uniform ad hoc wireless networks. Proceedings of IEEE ICC’04:4331–4335
Penrose M.D. (1999). On k-connectivity for a geometric random graph. Wiley Random Structures and Algorithms 15(2):145–164
Tseng, C. C., & Chen, K. C. (2004). Power efficient topology control in wireless ad hoc networks. IEEE WCNC 2004, 610–615.
Tseng, C. C., & Chen, K. C. (2005). Clustering wireless ad hoc networks with boundary nodes. IST Mobile & Wireless Communications Summit 2005.
Rappaport, T. S. (2002). Wireless communications, Principles and Practice 2nd Edn, Upper Saddle River Prentice-Hall PTR, 2002.
Tseng, C. C., Chen, H. T., & Chen, K. C. (2006). On the distance distributions of the wireless ad hoc networks. IEEE VTC 2006 Spring, pp. 772–776.
Thompson, H. R. (1956). Distribution of distance to nth neighbor in a population of randomly distributed individuals. Ecology, 37(2).
Miller, L. E. (2003). Joint distribution of link distances. 2003 Conference on Information Sciences and Systems (CISS 2003), The Johns Hopkins University.
Tseng, C. C., Chen, H. T., & Chen, K. C. (2006). Characterizing the wireless ad hoc networks by using the distance distributions. IST Mobile & Wireless Communications Summit 2006.