A new mechanism for MPR selection in mobile ad hoc and sensor wireless networks

被引:0
作者
Belichira, Sid Ahmed Hichame [1 ,2 ]
Boukli-Hacene, Sofiane [3 ]
Lorenz, Pascal [4 ]
Belkheir, Mohamed [5 ]
Gilg, Marc [4 ]
Zerroug, Abdelhalim [6 ]
机构
[1] Univ Ctr Nour Bachir El Bayadh, Elbayadh, Algeria
[2] Univ Haute Alsace, Mulhouse, France
[3] Univ Djillali Liabes Sidi Bel Abbes, EEDIS Lab, Sidi Bel Abbes, Algeria
[4] Univ Haute Alsace, IRIMAS Lab, Colmar, France
[5] Univ Ctr Nour Bachir El Bayadh, LIMA Lab, Elbayadh, Algeria
[6] SONATRACH Oil & Gas Co, Algiers, Algeria
来源
ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2020年
关键词
Ad hoc Wireless Sensor Networks; OLSR; Network Lifetime; Energy Optimization; MPRs;
D O I
10.1109/icc40277.2020.9148633
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In mobile and sensor wireless networks, liaising between wireless nodes is performed using routing protocols. Each protocol has its advantages and drawbacks. OLSR is one of the most widely used protocols, due its proactive scheme. It is based on the principle of Multi Point Relay (MPR) which essentially consists in building a "relevant" set of links and direct neighbors by ignoring redundancies in order to have optimal paths. This relevance is demonstrated by criteria that allow the entire neighborhood of a node to be reached by two hops (all neighbors of neighbors). However, these criteria do not take into consideration other important factors that have a strong influence on the protocol's behavior such as the residual energy, which may lead to degrading the overall network lifetime. In this paper, we present a new method to overcome this problem, allowing mobile nodes within ad hoc and sensor wireless networks to determine an efficient set of their routers using OLSR Protocol, based on the energy constraint of their neighborhood. Due to the random mobility of nodes in such networks, an efficient calculation algorithm of routers for each node seems an obligation, in order to avoid link breakage and assure a high level of the network availability. Our new algorithm consists on introducing a dynamic weighting ratio between the reachability and the residual energy of the one hop neighbors of each node for selecting its routers. One of a statistical method to discover the neighborhood is the dispersion calculation of the residual energy that allows a node to find out how spreads are energies of its neighborhood. This calculation is introduced in the router selection algorithm. Thus, this method allows a load balancing in the network and avoids the rapid decrease of nodes batteries that have been selected as routers for a long time. Simulations results show that our new approach significantly increases the lifetime of the mobile ad hoc networks by decreasing the dead nodes number.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] The impact of disabling suspicious node communications on network lifetime in wireless ad hoc sensor networks
    Pala, Zeydin
    Inanc, Nihat
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2016, 24 (05) : 4429 - 4444
  • [22] Power Aware Routing in Ad Hoc Wireless Networks
    Rishiwal, Vinay
    Yadav, Mano
    Verma, S.
    Bajapai, S. K.
    JOURNAL OF COMPUTER SCIENCE & TECHNOLOGY, 2009, 9 (02): : 101 - 109
  • [23] Lifetime Estimation and Measurement for Wireless Ad Hoc Networks
    Vanjale, Mousami
    Chitode, Janardan S.
    Gaikwad, Shilpa P.
    WIRELESS PERSONAL COMMUNICATIONS, 2020, 113 (01) : 617 - 631
  • [24] Lifetime-enhancing selection of monitoring nodes for intrusion detection in mobile ad hoc networks
    Kim, H
    Kim, D
    Kim, S
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2006, 60 (03) : 248 - 250
  • [25] An efficient clustering approach for optimized path selection and route maintenance in mobile ad hoc networks
    Vatambeti, Ramesh
    Sanshi, Shridhar
    Krishna, D. Pramodh
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021, 14 (1) : 305 - 319
  • [26] Mobility Effects on the Performance of Mobile Ad hoc Networks
    Ikeda, Makoto
    Hiyama, Masahiro
    Barolli, Leonard
    Xhafa, Fatos
    Durresi, Arjan
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010), 2010, : 230 - 237
  • [27] An efficient clustering approach for optimized path selection and route maintenance in mobile ad hoc networks
    Ramesh Vatambeti
    Shridhar Sanshi
    D. Pramodh Krishna
    Journal of Ambient Intelligence and Humanized Computing, 2023, 14 : 305 - 319
  • [28] A large scale wireless mobile ad hoc network testbed
    Owada, Y
    Takahashi, Y
    Suda, T
    Terui, H
    Taki, F
    Yagi, T
    Mase, K
    VTC2005-FALL: 2005 IEEE 62ND VEHICULAR TECHNOLOGY CONFERENCE, 1-4, PROCEEDINGS, 2005, : 324 - 328
  • [29] Lifetime Estimation and Measurement for Wireless Ad Hoc Networks
    Mousami Vanjale
    Janardan S. Chitode
    Shilpa P. Gaikwad
    Wireless Personal Communications, 2020, 113 : 617 - 631
  • [30] Investigation of TCP and UDP multiple-flow traffic in wireless mobile ad-hoc networks
    Ikeda, Makoto
    Kulla, Elis
    Hiyama, Masahiro
    Barolli, Leonard
    Takizawa, Makoto
    JOURNAL OF HIGH SPEED NETWORKS, 2013, 19 (02) : 129 - 145