ARPN Journal of Science and Technology Logo

ARPN Journal of Science and Technology >> Volume 7, Issue 1, January 2017

ARPN Journal of Science and Technology

An Efficient Routing Algorithm (MASH) in Mesh Networks Using DBVM

Full Text Pdf Pdf
Author K. Kumaravel, A. Marimuthu
ISSN 2225-7217
On Pages 202-208
Volume No. 4
Issue No. 3
Issue Date April 01, 2014
Publishing Date April 01, 2014
Keywords Optimization of clustering, WSN (Wireless sensor networks), independent dominating set, bird view model.


In this modern world, there is more development in the field of mesh in WSNs. The interconnection of the network nodes, computer and other devices (i.e.. interconnected with one another) is called the mesh topology. Each and every node has a capability to sends its own signals as well as relays data from other nodes also. Every node is connected to each and every node in the network is known as a true topology of mesh. The wireless networks are widely applying this topology. In this type of mesh topology, the technique of routing or flooding is applied. The concurrent transmission of data from various devices is its main advantage. The high traffic is resisted by this mesh topology. The data transmission gets struck, because there is an option for transmission even if one of the node goes wrong (i.e. fails). In the absence of other nodes, the alteration and enlargement in the mesh topology can be performed. In this research paper, we proposed a new algorithm named as optimized mash routing algorithm (OMRA). we proposes a new topology structure for mesh wireless sensor network for before sending packets, this process helps to make a better way to sending packets and It reduces a Load versus energy oriented routing issues and data loss. It will give a better result compared with Traditional routing protocols. Through this model, from source to destination it firstly focuses on dynamic bird view model (DBVM). From the above view, we are able to get the distance and get the classification of routes which is safer in analyzing by throughput, bandwidth and node behavior. From that view it gives a clear picture in identifying the ideal route by using the behavior of nodes where as it makes more effective in reaching the destination. In addition, it also reduces the data loss and propagation delay.

    Journal of Computing | Journal of Systems and Software     
2014 ARPN Publishers