scholarly journals File Distributed for Improving Data Accessibility in Adhoc Networks

Author(s):  
Mr. M. Karthikeyan ◽  
Mrs P. Shanmuga Priya ◽  
Mrs S. Kiruthika

File searching turns out to be difficult since nodes in MANETs move around freely and can exchange information only when they are within the communication range. Broadcasting can quickly discover files, but it leads to the broadcast storm problem with high energy consumption. File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of such networks including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica creation with minimum average querying delay. Specifically, current file replication protocols in mobile ad hoc networks have two shortcomings.

2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Sumet Prabhavat ◽  
Worrawat Narongkhachavana ◽  
Thananop Thongthavorn ◽  
Chanakan Phankaew

Mobile Opportunistic Networks (OppNets) are infrastructure-less networks consisting of wireless mobile nodes and have been a focus of research for years. OppNets can be scaled up to support rapid growth of wireless devices and technologies, especially smartphones and tablets. Mobile Ad Hoc Networks (MANETs), one of OppNets technologies, have a high potential to be used for facilitating an extension for the Internet and a backup communication platform in disaster situation. However, a connection disruption due to node mobility and unreliable wireless links is possible to trigger a flooding operation of route repair process. This results in transmission delay and packet loss. The flooding of routing packets is an expensive operation cost in MANETs which affects network reliability and wastes limited resources such as network bandwidth and node energy. These are obstacles to practical implementation of MANETs in real-world environment. In this paper, we propose Low Overhead Localized Flooding (LOLF), an efficient overhead reduction routing extension based on Query Localization (QL) routing protocol. The purpose of this work is to control the propagation of routing packets in the route discovery and route repair mechanisms while incurring only a small increase in the size of control information in the packet. Simulation results from extensive experiments show that our proposed method can reduce overall routing overhead, energy consumption, and end-to-end delay without sacrificing the packet delivery ratio compared to existing protocols.


Energies ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 2219 ◽  
Author(s):  
Dong Yang ◽  
Hongxing Xia ◽  
Erfei Xu ◽  
Dongliang Jing ◽  
Hailin Zhang

To mitigate the frequent link breakage and node death caused by node mobility and energy constraints in mobile ad-hoc networks, we propose an energy-balanced routing algorithm for energy and mobility greedy perimeter stateless routing (EM-GPSR) based on geographical location. In the proposed algorithm, the forward region is divided into four sub-regions. Then, according to the remaining lifetime of each node and the distance between the source node and the destination node, we select the next-hop node in the candidate sub-regions. Since the energy consumption rate of the node is taken into account, the next-hop selection favors the nodes with longer remaining lifetimes. Simulation results show that compared with conventional greedy perimeter stateless routing (GPSR) and speed up-greedy perimeter stateless routing (SU-GPSR) routing algorithms, the proposed algorithm can lead to a lower end-to-end delay, longer service time, and higher transmission efficiency for the network.


2014 ◽  
Vol 513-517 ◽  
pp. 1811-1818
Author(s):  
Xiao Fei Wang ◽  
Ying Cai ◽  
Zhuo Li

A lack of centralized administrator has made communications in mobile ad hoc networks relied on cooperation of mobile nodes. Apparently, their limited energy cannot provide a sustained supply for consumption on operations, such as relaying, forwarding, etc. This may cause the self-ish behaviors of non-cooperative nodes, resulting in degradation on the stability or reliability of routing. The self-ishness worsens because of node mobility. Most existing works were considering external profits and inner motivations. In this paper, we analyzed three kinds of incentive mechanisms based on virtual currency, reputation and game theory, respectively. We compared application scenarios and performance of these mechanisms, and discussed their limitations. Finally we proposed possible directions for the future research on the incentive mechanisms in mobile ad hoc networks.


2019 ◽  
Vol 8 (4) ◽  
pp. 8689-8694

Ad-hoc networks are communications less wireless networks; the most critical problem in mobile ad-hoc networks is energy utilization. Energy could be a restricted resource. All nodes eavesdrops the data transference in its locality and uses energy without need. Nevertheless various existing routing procedures collect route information via eavesdropping. The important reason for more energy utilization is unnecessary eavesdropping and rebroadcasting of RREQ to nodes. We propose a new mechanism to decrease energy consumption called Minimum Number of Neighbor Nodes and Transmission Range Based Overhearing Controlled Protocol. In which node has a choice of whether to send a packet or not by transmit effective info in Announcement Traffic Indication Message (ATIM) window and node selection on the basis of Transmission range and RES. The Proposed protocol is high energy-efficient compared to Conventional 802.11 PSM-established projects.


Sign in / Sign up

Export Citation Format

Share Document