2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing 2014
DOI: 10.1109/iih-msp.2014.176
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Relay Placement Algorithm Based on Puzzle Games for Indoor Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…The first proposed framework focused on the movements of RNs based on virtual force on the other hand the second proposed framework utilized the concept of Game Theory among the partitions of the network. Next, Chang et al [21] have proposed an efficient framework for jigsaw-based placement of RNs for indoor WSNs. They aimed at constructing the WSNs, with the minimum number of RNs and SNs in an indoor space with obstructions.…”
Section: Related Workmentioning
confidence: 99%
“…The first proposed framework focused on the movements of RNs based on virtual force on the other hand the second proposed framework utilized the concept of Game Theory among the partitions of the network. Next, Chang et al [21] have proposed an efficient framework for jigsaw-based placement of RNs for indoor WSNs. They aimed at constructing the WSNs, with the minimum number of RNs and SNs in an indoor space with obstructions.…”
Section: Related Workmentioning
confidence: 99%
“…Problem with this approach is that it requires more computational time and high cost. Chang H. Y. et al, [18] propose a new Jigsaw-based relay placement algorithm (JRPI) for indoor WSNs. Senturk I. F. et al, [19] propose two distributed RNP algorithms to ensure network recovery for segmented WSN.…”
Section: Algorithm Based Techniquesmentioning
confidence: 99%
“…If yes then it will be added else it will be discarded. Lines (17)(18)(19)(20)(21) find all the neighbouring partitions of New_RN. Line 22 increase the number of partitions by adding New_RN as new partition in both partition array and _ list if no neighbour is found.…”
Section: Explanation Of Our Proposed Solution (Worph)mentioning
confidence: 99%
See 1 more Smart Citation