Shortest Path Solution to Wireless Sensor Networks Using Edge-Based Three-Point Steiner Tree Concept

被引：0

作者：

Sundar, S. ^{[1
]}

Balakrishnan, V. ^{[1
]}

Kumar, R. ^{[2
]}

Kittur, Harish M. ^{[1
]}

机构：

[1] VIT Univ, Sch Elect Engn, Vellore 632014, Tamil Nadu, India

[2] WIPRO Technol, Madras, Tamil Nadu, India

来源：

WIRELESS COMMUNICATION NETWORKS AND INTERNET OF THINGS, VOL VI | 2019年 / 493卷

关键词：

Steiner tree; Bridge node; Mobile node; Edge-based three-point; OPTIMIZATION; ALGORITHMS;

D O I：

10.1007/978-981-10-8663-2_6

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Wireless sensor networks have gained immense significance and popularity in modern technology especially as a result of emerging concepts like the Internet of Things (IoT). These networks are usually under constant pressure to scale-up in order to meet the ever-growing demand. Under such situations, it is often required to connect two existing adjacent, but independent, networks so that they form a single larger network. Some of the networks may even have mobile nodes. This paper proposes an effective method for placing a bridge node in the intersection of coverage region of two networks using a combination of Steiner tree algorithm and concept of edge nodes-Edge-based Three-Point Steiner (EdTPS) tree-such that communication across the network can be carried out with the shortest possible path.

引用

页码：51 / 67

页数：17

共 50 条

[1] Edge-Based Shortest Path Caching in Road Networks
Zhang, Detian
Liu, An
Jin, Gaoming
Li, Qing
[J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2019, 11448 : 411 - 414
[2] An efficient topology maintenance algorithm based on shortest path tree for wireless sensor networks
Shen, Z
Chang, YL
Zhang, X
Cui, C
[J]. PDCAT 2005: SIXTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2005, : 288 - 292
[3] Maximizing Lifetime for the Shortest Path Aggregation Tree in Wireless Sensor Networks
Luo, Dijun
Zhu, Xiaojun
Wu, Xiaobing
Chen, Guihai
[J]. 2011 PROCEEDINGS IEEE INFOCOM, 2011, : 1566 - 1574
[4] Double edge-based traceback for wireless sensor networks
Zhang, Zhiming
Li, Ping
Wu, Fuying
Deng, Jiangang
[J]. INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS, 2015, 15 (01) : 107 - 126
[5] Clustering Algorithm in wireless sensor networks based on shortest path
El Khediri, Salim
Thaljaoui, Adel
Dallali, Adel
Kachouri, Abdennaceur
[J]. 2018 30TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS (ICM), 2018, : 335 - 338
[6] BeamStar: An edge-based approach to routing in wireless sensor networks
Mao, Shiwen
Hou, Y. Thomas
[J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (11) : 1284 - 1296
[7] Connectivity Restoration in Wireless Sensor Networks using Steiner Tree Approximations
Younis, Mohamed
Waknis, Rahul
[J]. 2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
[8] Shortest Path Tree Scaling Hierarchical Power Efficient Routing for Wireless Sensor Networks
Shah, Mumtaz
Dogar, Abdul Basit
Abbas, Ghulam
[J]. 2013 IEEE 9TH INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES (ICET 2013), 2013, : 367 - 372
[9] Maximum-Energy Shortest Path Tree for Data Aggregation in Wireless Sensor Networks
Zhang, Yunyi
Wang, Yi
Zhang, Deyun
Huang, Chongzheng
[J]. 2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 2779 - +
[10] Quadrilateral Steiner tree based connectivity restoration for wireless sensor networks
College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
不详
[J]. Jisuanji Xuebao, 2 (457-469):

← 1 2 3 4 5 →