Effective data routing using mobile sinks in disjoint mobile wireless sensor networks

Ramadan, Hager; Khedr, Ahmed M.; Agrawal, Dharma P.

doi:10.21533/pen.v7i1.411

Cited by 6 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Anchor Free localization deploys a relative location of sensor nodes that are considered to compute in their absolute location. In [9] a comparison between anchors based and anchor free methods has been discussed for using beacons as reference nodal points in anchor based rather than anchor free method. Hence, at fist in anchor based method, a set of reference points are identified then, after implementing a spatial relation with reference points, the process of estimating their own locations will be done.…”

Section: -Anchor Based and Anchor Free Methods [8] 2-range Based And mentioning

confidence: 99%

An Overview on Wireless Sensor Networks and Finding Optimal Location of Nodes

Khalaf

Sabbar

2019

j comput theor nanosci

View full text Add to dashboard Cite

In this review, our aim is to make a brief description about technology of Wireless Sensor Network (WSN) and its capability to pave the way in order to make connection between physical and virtual world based on Internet worldwide network. Hence, in this technology, sensor nodes play an important role to transmit data from a node to other defined nodes in its broaden range. Due to gain most optimal state from WSNs, subject of localization for radio frequency networks has a great importance in many technical applications such as military devices to detect specified local points to attack or defend, civil engineering and in general sensor networks. The main technology to obtain direct locations is GPS (Global Positioning System). After expressing a brief history on introduction part, we will go through in order to interrogate on main structure of WSNs regarding mathematical formulations and algorithms to find best and optimal access points based on Localization action. Then, we summarize algorithms and approaches to develop in order to introduce the best strategy in order to access nodes in the best possible state in WSNs. As a result, we conclude about the mentioned issues in order of comparison and reaching a final result. Therefore, final aim of this review is to explain efficiency and reliability of localization based on different opinions. Results show this overwhelming technology can be completely modified in order to find new solutions to find nodes in most optimal nodes based on spontaneous structure of WSNs.

show abstract

Section: -Anchor Based and Anchor Free Methods [8] 2-range Based And mentioning

confidence: 99%

An Overview on Wireless Sensor Networks and Finding Optimal Location of Nodes

Khalaf

Sabbar

2019

j comput theor nanosci

View full text Add to dashboard Cite

show abstract

“…Each node sends and replies control messages for routing on the same path [14], [21]. There are three categories of uniform routing protocols [17], [21]; these classes are proactive, hybrid, and reactive [6], [11]. The following protocols are emphasized in our research; proactive (DSDV), reactive (DSR) and (AODV) protocols.…”

Section: )mentioning

confidence: 99%

Unicast based reactive & proactive routing simulation in MANET: A comparative study for protocols in mobility scenarios

Yadgar

Alabdullah

Atiyah

et al. 2019

PEN

View full text Add to dashboard Cite

A challenging issue for Ad-Hoc network is finding an effective routing mechanism, the wireless connection must have the capability to interact while traveling randomly. Although MANETs are self-configuring mobile node networks, the mobility of the nodes imposes some limitations on the power capacity of the nodes and thus on the transmission ranges. Many studies have investigated the protocols of Ad-Hoc networks, but this study has made a comprehensive investigation by using different scenarios among the studied protocols, particularly (DSR), (AODV) and (DSDV). The different numbers of deployed nodes with a mobile target node in the network have been analyzed with various important metrics such as; Generated, sent and received packet, lost and discarded packets, throughput, and the end to end latency with different packet sizes. Simulations are carried out in the simulation environment (NS2), and several comparisons were made among different metrics and scenarios by using different utilities. The results obtained showed interesting findings particularly when the scenario became more complex and the number of nodes increased. The number of packets received decreases by the mobile target node with the increasing number of nodes in the network. AODV showed better efficiency than the DSR and table-based DSDV protocol especially when a large number of nodes deployed. Furthermore, the average of the received packets to the sent packet ratio decreases proportionally as the number of nodes increases while the average end-to-end delay increases with the increasing number of nodes.

show abstract

“…Accordingly, the initial deployment of nodes in WSN can be either done in a planned or structured manner or in a semirandom way. In most cases, the placement of mobile sinks optimally is not known as priori; hence the heuristic is required to facilitate the position of the sink at a new location [9][10][11]. In [12], the maximumminimum energy consumption approach is developed to find the optimal path between the sink nodes and the network neutron nodes.…”

Section: Introductionmentioning

confidence: 99%

Optimal Placement of Mobile Sink in Wireless Sensor Network Using AdjacencyBased Cell Score Factor

AR¹,

Chakravarthi²

2021

IJIES

View full text Add to dashboard Cite

Wireless sensor network (WSN) employs the mobile sink to collect the information from the sensor nodes that are deployed in the network environment in such a way to reduce the energy hole issues. However, the placement of mobile sinks optimally in the network without degrading network lifetime result in a great challenge. Thus, the adjacency-based cell score factor is adopted in this research in order to place the mobile sink optimally in WSN. Here, the network is transformed into the cell using the Voronoi transformation. For each uniform-sized cell, the cluster head (CH) is selected using Sparse-Fuzzy C-means clustering. The optimal placement of the mobile sink is carried out using the adjacency-based cell score, which effectively places the mobile sink using the constrained factors, such as energy, Euclidean distance, and fairness. The proposed adjacency-based cell score obtained better performance with a minimal distance of 22.4615m, maximal energy, fairness, network lifetime, and throughput of 97.2182, 92.6064, 145, and 95.8852, respectively, while considering 400 nodes.

show abstract

Effective data routing using mobile sinks in disjoint mobile wireless sensor networks

Cited by 6 publications

References 27 publications

An Overview on Wireless Sensor Networks and Finding Optimal Location of Nodes

An Overview on Wireless Sensor Networks and Finding Optimal Location of Nodes

Unicast based reactive & proactive routing simulation in MANET: A comparative study for protocols in mobility scenarios

Optimal Placement of Mobile Sink in Wireless Sensor Network Using AdjacencyBased Cell Score Factor

Contact Info

Product

Resources

About