scholarly journals Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem

2017 ◽  
Vol 21 (4) ◽  
pp. 527-546 ◽  
Author(s):  
Ahmad Biniaz ◽  
Prosenjit Bose ◽  
Ingo van Duijn ◽  
Anil Maheshwari ◽  
Michiel Smid
Keyword(s):  
Graph Problem ◽  
Spanning Graph

Exploring the constrained maximum edge-weight connected graph problem

2009 ◽  
Vol 25 (4) ◽  
pp. 697-708 ◽  
Author(s):  
Zhen-ping Li ◽  
Shi-hua Zhang ◽  
Xiang-Sun Zhang ◽  
Luo-nan Chen
Keyword(s):  
Connected Graph ◽  
Edge Weight ◽  
Graph Problem

scholarly journals An obstacle aware mobile sink path strategy in WSN

2019 ◽  
Vol 15 (2) ◽  
pp. 879
Author(s):  
T. H. Feiroz Khan ◽  
D. Siva Kumar
Keyword(s):  
Network Lifetime ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Mobile Sink ◽  
Cuckoo Search Algorithm ◽  
Base Station ◽  
Moving Obstacles ◽  
Super Node ◽  
Spanning Graph ◽  
Path Scheduling

<span>In Wireless Sensor Networks, Mobile Sink accomplishes considerable achievement on network lifetime improvement. In sensing environment, more chances to present the obstacle. But, in the mobile sink, how to identify the obstacle and make the obstacle aware path strategy is a challenging task. To overcome this problem, we propose an Obstacle Aware Mobile sink Path Strategy (OAMPS) that detects any obstacles which enter within the network lifetime and design a shortest mobile sink movement path avoiding detected obstacles. In this scheme, the mobile sink collects the sensing data from the super node then it sends the data to the base station. Here, static or moving obstacles are present when the mobile sink moves the path scheduling by spanning graph. This algorithm is introduced to discovering the obstacle avoiding shortest path. The source selects the route by the updated cuckoo search algorithm. The simulation results show that the OAMPS improved the throughput and minimized the delay in the network.</span>

Sign in / Sign up

Export Citation Format

Share Document