A New Node Density Based k-edge Connected Topology Control Method: A Desirable QoS Tolerance Approach
محورهای موضوعی : Wireless Network
1 - Azarbijan Shahid Madani Universoty
کلید واژه: Localtopology Control , k-edge Connectivity , Node Density, MANET , Optimizedenergy Consumption , QoS,
چکیده مقاله :
This research is an ongoing work for achieving consistency between topology control and QoS guarantee in MANET. Desirable topology and Quality of Service (QoS) control are two important challenges in wireless communication networks such as MANETs.In a Mobile Ad hoc Network, MANET, nodes move in the network area; therefore, the network topology is randomly and unpredictably changed. If the network topology is not controlled properly, the energy consumption is increased and also network topology probably becomes disconnected. To prevent from this situation, it is necessary to use desirable dynamic topology control algorithms such as k-edge connectivity methods. This papertries to improvethe three following parameters according to the k-edge connectivity concepts: (1) network performance, (2) reduce energy consumption, and (3) maintain the network connectivity. To achieve these goals, as a new method, we enhance k-edge connectivity methods using an improved definition of node density. The new method is called as: Node Density Based k-edge connected Topology Control (NDBkTC) algorithm. For the first time the node density definition is dynamically used. The new method, computes the node density based on a new equation which consists of the following factors: the relative velocity of nodes, distance between nodes, the number of nodes and the transmission range of nodes. The results show that our new method improves the network performance compared with the existing methods. Also we will show that the new method can holds QoS in a desirable tolerance range.
This research is an ongoing work for achieving consistency between topology control and QoS guarantee in MANET. Desirable topology and Quality of Service (QoS) control are two important challenges in wireless communication networks such as MANETs.In a Mobile Ad hoc Network, MANET, nodes move in the network area; therefore, the network topology is randomly and unpredictably changed. If the network topology is not controlled properly, the energy consumption is increased and also network topology probably becomes disconnected. To prevent from this situation, it is necessary to use desirable dynamic topology control algorithms such as k-edge connectivity methods. This papertries to improvethe three following parameters according to the k-edge connectivity concepts: (1) network performance, (2) reduce energy consumption, and (3) maintain the network connectivity. To achieve these goals, as a new method, we enhance k-edge connectivity methods using an improved definition of node density. The new method is called as: Node Density Based k-edge connected Topology Control (NDBkTC) algorithm. For the first time the node density definition is dynamically used. The new method, computes the node density based on a new equation which consists of the following factors: the relative velocity of nodes, distance between nodes, the number of nodes and the transmission range of nodes. The results show that our new method improves the network performance compared with the existing methods. Also we will show that the new method can holds QoS in a desirable tolerance range.
[1] Paolo Santi, Topology control in ad hoc and sensor networks, John Wiley & Sons,2005, pp 16-100. #
[2] B. Bollaobas, “Modern graph theory”, Graduate Texts in Mathematics, vol. 189, , no. 10, pp. 56-99, Jan, 1998. #
[3] J. Pan, L. Cai, Y. Hou, Y. Shi, and X. Shen, “Optimal base-station locations in two-tiered wireless sensor networks”, IEEE Trans. Mobile Comput., vol. 4, no. 5, pp. 458–473, Sep. 2005.#
[4] J. Zhang, J. Chen, and Y. Sun, “Transmission power adjustment of wireless sensor networks using fuzzy control algorithm”, Wireless Communication and Mobile Computing (Wiley), vol. 9, no. 6, pp. 805–818, June 2009.#
[5] N. Li, J.C. Hou, and L. Sha, “Design and analysis of an MST-based topology control algorithm”, IEEE Trans. Wireless Commun.,vol.4, no. 3, pp. 259–270, May 2005.#
[6] G. Toussaint, “The relative neighborhood graph of finite planar set”, Pattern Recognition, vol. 12, no. 4, pp. 261–268, 1980.#
[7] L. Li and J. Y. Halpern, “Minimum energy mobile wireless networks revisited”, in Proc. 2001 IEEE ICC, 2001, pp. 278–283.#
[8] N. Li and J. C. Hou, “Localized fault-tolerant topology control in wire-less ad hoc networks”, IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 4, pp. 307–320, Apr. 2006.#
[9] K. Miyao, H. Nakayama, N. Ansari, and N. Kato, “LTRT: an efficient and reliable topology control algorithm for ad-hoc networks”, IEEE Trans. Wireless Commun., vol. 8, no. 12, pp. 6050-6058, Dec. 2009.#
[10] H.Nishiyama, T.Ngo, N. Ansari, N. Kato, “On Minimizing the Impact of Mobility on Topology Control in Mobile Ad Hoc Networks”, IEEE Transaction On Wireless Communications, vol. 11, no. 3, pp. 1158-1166, March. 2012.#
[11] Prim, R. C., "Shortest connection networks and some generalizations", Bell System Technical Journal, vol. 36, no. 6, pp. 1389–1401, November 1957.#
[12] X. Li, Y. Wang, and W. Song, “Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks”, IEEE Trans. Parallel and Distrib. Syst., vol. 15, no. 12, pp 1057–1069, Dec. 2004.#
[13] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized minimum-energy broadcasting in ad-hoc networks”, in Proc. 2003 IEEE INFO-COM, 2003, pp. 2210–2217.#
[14] J. Cartigny, F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, “Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks", Ad Hoc Networks, vol. 3, no. 1, pp. 1-16, 2005.#
[15] V. Rodoplu and T. H. Meng, “Minimum energy mobile wireless networks”, IEEE J. Sel. Areas Commun., vol. 17, no. 8, pp. 1333–1344, Aug. 1999.#
[16] E. W. Dijkstra, “A note on two problems in connexion with graphs”, Numerische Mathematik , vol. 1, no. 1, pp. 269–271, Dec. 1959.#
[17] M. Bahramgiri, M. T. Hajiaghayi, and V. S. Mirrokni, “Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks”, Wireless Network, vol. 12, no. 2, pp. 179–188, Mar. 2006.#
[18] L. Li, J. Y. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, “Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks”, in Proc. 2001 ACM PODC, pp. 264–273, 2001.
[19] N. Ansari, G. Cheng, and R. Krishna n, “Efficient and reliable link state information dissemination”, IEEE Commun. Lett., vol. 8, no. 5, pp. 317– 319, May 2004.#
[20] R. Azzeddine and W. Dong, “A simple fault-tolerant local topology control algorithm for sensor networks”, presented at IEEE conference on Industrial electronics and applications (ICIEA), Japan, 2012.#
[21] Ch. Bettstetter, “On the minimum node degree and connectivity of a wireless multi-hop network”, presented at the MOBIHIC’02 Int. Conf, EPF Lausanna, Switzerland, 2002.#
[22] N. Bulusu, D. Estrin, L. Girod, J. Heidemann, “Scalable coordination of wireless sensor networks: self-configuring localization systems”, in Proc. Of the international symposium communication theory and applications (ISCTA’01), UK, 2001, pp. 1-6. #
[23] M. Shiwen, Fundamentals of communication networks, Cognitive Radio Communications and Networks, New Yourk, Elsevior, 2010, pp. 201-234.#
[24] S. Wolf, Optimization problems in self-organization networks, Berlin, Logos Verlag Berlin GmbH, 2010, pp. 160-161. #
[25] A. Isazadeh, M. Heydarian, “Optimal multicast multichannel routing in computer networks”, Computer Communications, vol. 31, pp. 4149–4161, June, 2008.#
[26] M. Heydarian, “A new high performance approach: merging optimal multicast sessions for supporting multisource routing”, Supercomputing, vol. 63, pp. 871–896, May, 2013.#
[27] Mrunal Gavhale, Pranay D. Saraf, “Survey on Algorithms for Efficient Cluster Formation and Cluster Head Selection in MANET”, Procedia Computer Science, Vol. 78, pp. 477-482, 2016. #
[28] Hasan Abdulwahid, BinDai, BenxiongHuang, Zijing Chen, “Scheduled-links multicast routingprotocol in MANETs”, Journal of Network and Computer Applications, vol. 63, pp. 56–67, May, 2016. #
[29] S. Gundry, J. Zou, M. Umit Uyar, C. S. Sahin, J. Kusyk, “Differential evolution-based autonomous and disruption tolerant vehicular self-organization in MANETs”, Ad Hoc Networks, Vol. 25, Part B, pp. 454-471, Jan. 2015. #
