%0 Journal Article %1 noauthororeditor %A Tarique1, Mohammed %D 2023 %E and Rumana Islam2, %J International Journal of Ad hoc, sensor & Ubiquitous Computing (IJASUC) %K computing myown %N 02 %P 01-14 %R 10.5121/ijasuc.2021.12201 %T Optimum neighbors for resourceconstrained mobile ad hoc networks %U https://aircconline.com/ijasuc/V12N2/12221ijasuc01.pdf %V 12 %X This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks (MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11 as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there is no global optimum number of neighbors for the mobility case.

@article{noauthororeditor, abstract = {This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks (MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11 as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there is no global optimum number of neighbors for the mobility case.}, added-at = {2023-07-19T14:47:59.000+0200}, author = {Tarique1, Mohammed}, biburl = {https://www.bibsonomy.org/bibtex/23b0ece833ff789140d19520f7d22a238/ijasa_journal}, description = {Wireless networking has been an active research focus since the early days of the packet radio network introduced by the Defense Advanced Research Project Agency (DARPA) [1]. Recent developments in wireless devices have made laptop computers, personal digital assistants (PDA), pagers, and cellular telephones portable. Now, users can carry these devices to any place at any time. Hence, there is a need for a network that can be deployed at any place at any time without any infrastructure support. In some cases, an infrastructure-based network is hard to build. Networks used by the soldiers on the battlefield are worthwhile to mention here. In some cases, infrastructures may not exist due to natural calamities such as cyclones, tsunami, and tornados. Hence, there is always a need for setting up a temporary network among a group of users without any pre-existing infrastructure and centralized administration. Mobile Ad hoc Networks (MANETs) are considered suitable solutions for these kinds of temporary networks. MANETs consist of a group of mobile nodes, which have limited battery and limited processing power. MANETs are self-organizing and self-configuring networks and they can be deployed without any infrastructure support. Numerous groundbreaking applications have been proposed based on MANETs}, doi = {10.5121/ijasuc.2021.12201}, editor = {and Rumana Islam2}, interhash = {000cd6e7b92aa4c52c32e359fb2f6fba}, intrahash = {3b0ece833ff789140d19520f7d22a238}, issn = {ISSN : 0976 - 1764 (Online); 0976 - 2205 (Print)}, journal = {International Journal of Ad hoc, sensor & Ubiquitous Computing (IJASUC) }, keywords = {computing myown}, language = {English}, month = {April}, number = 02, pages = {01-14}, timestamp = {2023-07-19T14:48:59.000+0200}, title = {Optimum neighbors for resourceconstrained mobile ad hoc networks }, url = {https://aircconline.com/ijasuc/V12N2/12221ijasuc01.pdf}, volume = 12, year = 2023 }