Routing with Virtual Transmission Range in Mobile Ad Hoc Networks

Author(s):  
Z. Wang ◽  
J. Zhang
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.


2014 ◽  
Vol 10 (1) ◽  
pp. 24 ◽  
Author(s):  
Ahmed Bisengar

In Mobile Ad hoc Networks (MANETs), where nodes have limited transmitting power, the transmission is typically multi-hop. The network topology changes frequently due to the unpredictable movement of mobile nodes because each node is free to move arbitrarily with different speeds. Thus, when one node enters in the transmission range of another node a link between those two nodes is established, and an existent link is broken when either node is out of the transmission range of the other. We refer as link duration, the time interval during in which the link still established.This paper presents a novel mobility metric for mobile ad hoc networks, called link duration (LD) that measures the stability of an active link. This mobility metric is introduced to represent relative mobility between nodes in multi-hop distance.


2009 ◽  
Vol 20 (12) ◽  
pp. 1871-1902 ◽  
Author(s):  
HOSSEIN MOHAMMADI ◽  
EHSAN NEDAAEE OSKOEE ◽  
MOHSEN AFSHARCHI ◽  
NASSER YAZDANI ◽  
MUHAMMAD SAHIMI

Mobile ad-hoc networks (MANETs) are random, self-configurable and rapidly-deployable networks. The main goal of developing the MANETs is not only obtaining better service, but also having networks that can serve in situations in which no other means of communications can operate. Examples include networks that are used in battlefields, in search-and-rescue operations, and networks of sensors. We propose a percolation model for studying the properties of the MANETs. The model is based on a random network of sites, distributed in space, which represent the mobile nodes. Two nodes are linked if they are within each other's transmission ranges. A node may be lost or become inactive if, for example, it runs out of energy (provided by its batteries). A link can be lost if, for example, one of its two end nodes moves outside of the other's transmission range. Extensive Monte Carlo simulations are carried out to study the properties of the model. The network's topology is characterized by a critical transmission range, which is the analogue of the percolation threshold. It is shown that not only can the model take into account several important features of the real MANETs and explain them in physical terms, but also leads to the development of efficient protocols for self-configuration, adaptability, and disaster survival, which are of utmost importance to the practical applications.


2011 ◽  
Vol 2011 ◽  
pp. 1-10
Author(s):  
Suchismita Chinara ◽  
Santanu Kumar Rath

The growth of interest and research on multihop wireless network is exponential in recent years. In mobile ad hoc networks (MANET), the nodes play the role of routers to forward the packets of neighbor nodes as there is no fixed infrastructure available to do so. Clustering is a proven solution that maps the architecture of cellular networks into ad hoc networks. Here, selected nodes form the virtual backbone of the network and take part in packet routing. This achieves faster packet delivery as limited nodes are responsible for the same even though the network is not strongly connected. In this paper, a distributed topology adaptive clustering algorithm is designed that requires local information by the nodes for the formation of clusters. The role of cluster head is fairly distributed among the nodes to obtain a longer network lifetime. The change of cluster heads and the mobility of nodes disturb the node connectivity resulting in communication instability. To overcome such situations, a topology control protocol is developed that adjusts the transmission range of concerned mobile nodes to achieve local connectivity among nodes within the clusters even after the hand-off by the heads takes place.


Sign in / Sign up

Export Citation Format

Share Document