Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566445
M. Saravanan, M. Rangachar
In the paper, a printed patch antenna with a rectangular slot is presented for RADAR altimeter application. The antenna is composed of single layer air substrate with double L-Shaped probe feed oriented 90° apart from each other and also with a shorting pin for impedance matching purpose. The measurements show that the antenna has a reflection coefficient bandwidth (S11 ≤ 20dB) of 4.6% (4.2 ~ 4.4 GHz) with a center frequency of 4.3 GHz and a gain of about 5.95 dB. The proposed antenna can be used for RADAR altimeter which are operating at 4.2 ~ 4.4 GHz band. A parametric study of geometric variation of L probe is given for clear understanding of radiation mechanism.
{"title":"A novel rectangular patch antenna with double L-probe fed for RADAR altimeter application","authors":"M. Saravanan, M. Rangachar","doi":"10.1109/WISPNET.2016.7566445","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566445","url":null,"abstract":"In the paper, a printed patch antenna with a rectangular slot is presented for RADAR altimeter application. The antenna is composed of single layer air substrate with double L-Shaped probe feed oriented 90° apart from each other and also with a shorting pin for impedance matching purpose. The measurements show that the antenna has a reflection coefficient bandwidth (S11 ≤ 20dB) of 4.6% (4.2 ~ 4.4 GHz) with a center frequency of 4.3 GHz and a gain of about 5.95 dB. The proposed antenna can be used for RADAR altimeter which are operating at 4.2 ~ 4.4 GHz band. A parametric study of geometric variation of L probe is given for clear understanding of radiation mechanism.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121313622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566424
S. Kumar, A. Umamakeswari
Wireless Sensor Networks is a resource constrained environment and security plays a major role in it. LEACH is one of the existing well-known cluster-based routing protocol. This protocol is vulnerable to several routing attacks, in which sinkhole attack is one of the most vulnerable threat. Intrusion Detection System is one of the efficient security mechanisms to counter the routing attacks by raising alarms and alerting the network. This paper proposes a generic specification based intrusion detection model namely SSLEACH to counter the sinkhole attack. The proposed SSLEACH mechanism is simulated in NS2 and the results show that SSLEACH outperforms the well-known existing schemes MS-LEACH and S-LEACH in terms of performance metrics like energy consumption, packet delivery rate, normalized overhead and residual energy.
{"title":"SSLEACH: Specification based secure LEACH protocol for Wireless Sensor Networks","authors":"S. Kumar, A. Umamakeswari","doi":"10.1109/WISPNET.2016.7566424","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566424","url":null,"abstract":"Wireless Sensor Networks is a resource constrained environment and security plays a major role in it. LEACH is one of the existing well-known cluster-based routing protocol. This protocol is vulnerable to several routing attacks, in which sinkhole attack is one of the most vulnerable threat. Intrusion Detection System is one of the efficient security mechanisms to counter the routing attacks by raising alarms and alerting the network. This paper proposes a generic specification based intrusion detection model namely SSLEACH to counter the sinkhole attack. The proposed SSLEACH mechanism is simulated in NS2 and the results show that SSLEACH outperforms the well-known existing schemes MS-LEACH and S-LEACH in terms of performance metrics like energy consumption, packet delivery rate, normalized overhead and residual energy.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124380840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566386
A. Roy, S. Maity
Among the different types of tumor in human body, brain tumor is one of the most life-threatening diseases and it should be detected accurately in early stage for proper treatment. Recently magnetic resonance imaging (MRI) is found to be efficient in detecting tumor as it does not need any opening on the human body. Presence of tumor in brain may be detected by segmenting the captured MR images. Tumor segmentation, however, is performed manually by radiologists which is a time consuming and also a subjective process. Furthermore, presence of the radiologists in a distant location often needs transmission over a radio mobile channel for which a high bandwidth is required. Keeping these in mind, in this work, an efficient low bandwidth transmission of the captured MRI brain images followed by its reconstruction and graph cut based automatic segmentation of the tumor is proposed. Compressed sensing (CS) is used to offer the facility of low bandwidth transmission. Extensive simulation results are also shown for reconstructed images followed by segmentation results.
{"title":"Graph cut method for automatic tumor detection in prediction based reconstructed MR image","authors":"A. Roy, S. Maity","doi":"10.1109/WISPNET.2016.7566386","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566386","url":null,"abstract":"Among the different types of tumor in human body, brain tumor is one of the most life-threatening diseases and it should be detected accurately in early stage for proper treatment. Recently magnetic resonance imaging (MRI) is found to be efficient in detecting tumor as it does not need any opening on the human body. Presence of tumor in brain may be detected by segmenting the captured MR images. Tumor segmentation, however, is performed manually by radiologists which is a time consuming and also a subjective process. Furthermore, presence of the radiologists in a distant location often needs transmission over a radio mobile channel for which a high bandwidth is required. Keeping these in mind, in this work, an efficient low bandwidth transmission of the captured MRI brain images followed by its reconstruction and graph cut based automatic segmentation of the tumor is proposed. Compressed sensing (CS) is used to offer the facility of low bandwidth transmission. Extensive simulation results are also shown for reconstructed images followed by segmentation results.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124142290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566589
Nouman Khan, Shalini Puri
In the current era of technology advancements, the number of digital transmission libraries are growing terribly quickly, the necessity to expeditiously index, browse and retrieve transmission data is hyperbolic. In this paper, a technical analysis on textual data identification and extraction from image is given in which various approaches for text detection and extraction are discussed and an evaluation is done on the popularity of approach. Models and their techniques are compared with the help of taxonomy which aims to show how the work flow can be described by various techniques and a study of different classifiers used by different models is also given. Results of various models are shown in the form of recall and precision and we have found that 0.1% of the algorithms achieved more than 99% recall and precision and on the basis of it efficiency of model is found.
{"title":"A study on text detection techniques of printed documents","authors":"Nouman Khan, Shalini Puri","doi":"10.1109/WISPNET.2016.7566589","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566589","url":null,"abstract":"In the current era of technology advancements, the number of digital transmission libraries are growing terribly quickly, the necessity to expeditiously index, browse and retrieve transmission data is hyperbolic. In this paper, a technical analysis on textual data identification and extraction from image is given in which various approaches for text detection and extraction are discussed and an evaluation is done on the popularity of approach. Models and their techniques are compared with the help of taxonomy which aims to show how the work flow can be described by various techniques and a study of different classifiers used by different models is also given. Results of various models are shown in the form of recall and precision and we have found that 0.1% of the algorithms achieved more than 99% recall and precision and on the basis of it efficiency of model is found.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131807471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566547
Manobendu Sarker
Cognitive radio is now come into attention for researchers as a new solution to face the challenge of the fast growing bandwidth demand. Spectrum sensing is a major problem for dynamic spectrum management in cognitive radio networks. This paper introduces a simple Hilbert transform based approach for efficient spectrum sensing of wideband channel in which soft de-noising is used to suppress the noise level. In this approach the effect of noise is suppressed first by averaging PSD of the received signal then de-noised by soft thresholding. Frequency boundaries of bands are found more accurately by Hilbert transform which is shown in simulation result so it will also ease to characterize by vacant or occupied by determining the average PSD of the consecutive bands. Our proposed method has also improved performance of detection in low SNR region than the conventional methods which is also portrayed by simulation result.
{"title":"Hilbert transform based edge detection approach for wideband spectrum sensing in cognitive radios","authors":"Manobendu Sarker","doi":"10.1109/WISPNET.2016.7566547","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566547","url":null,"abstract":"Cognitive radio is now come into attention for researchers as a new solution to face the challenge of the fast growing bandwidth demand. Spectrum sensing is a major problem for dynamic spectrum management in cognitive radio networks. This paper introduces a simple Hilbert transform based approach for efficient spectrum sensing of wideband channel in which soft de-noising is used to suppress the noise level. In this approach the effect of noise is suppressed first by averaging PSD of the received signal then de-noised by soft thresholding. Frequency boundaries of bands are found more accurately by Hilbert transform which is shown in simulation result so it will also ease to characterize by vacant or occupied by determining the average PSD of the consecutive bands. Our proposed method has also improved performance of detection in low SNR region than the conventional methods which is also portrayed by simulation result.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"45 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120857299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566451
Amrita Ruperee, S. Nema
In Multi User (MU) Massive MIMO Base Station is provided with large number of antennas to serve number of single antenna user terminals. It offers several benefits over conventional MIMO and takes the advantage of multipath propagation by sending and receiving multiple data signals in same time-frequency resource which increases the throughput, coverage, and reliability. Massive MIMO, averages out the small scale fading and thermal noise. This averaging is done as the number of BS antennas increases without limit (M ≫ K). One of the limiting factor for the performance of Massive MIMO system is pilot contamination. Reuse of the orthogonal pilot sequences in adjacent cells cause pilot contamination. Pilot contamination causes poor channel estimation at the BS and degrades the performance of the system. The proposed scheme improves the performance of downlink by optimized allocation of pilot sequences and using fractional frequency reuse factor (1/N). All the available pilot signals are equally divided among the cells as per the cluster size (N = 1, 3, 7). In the proposed scheme orthogonal pilot signal is transmitted by each user terminal to get the Channel State Information (CSI) to estimate the channel. SIR and terminal capacity for the downlink are calculated for the given number of user terminals using linear precoding (Matched Filter and Zero Forcing) schemes which are the function of the estimated channel and the pilot transmission power (ρp). It is observed that there is significant improvement in Pilot Signal to Interference Plus Noise (PSINR), SIR and terminal capacity by reducing fractional frequency reuse factor i.e. (N = 1, 3, 7).
{"title":"Fractional frequency reuse to enhance down link performance in MU Massive MIMO","authors":"Amrita Ruperee, S. Nema","doi":"10.1109/WISPNET.2016.7566451","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566451","url":null,"abstract":"In Multi User (MU) Massive MIMO Base Station is provided with large number of antennas to serve number of single antenna user terminals. It offers several benefits over conventional MIMO and takes the advantage of multipath propagation by sending and receiving multiple data signals in same time-frequency resource which increases the throughput, coverage, and reliability. Massive MIMO, averages out the small scale fading and thermal noise. This averaging is done as the number of BS antennas increases without limit (M ≫ K). One of the limiting factor for the performance of Massive MIMO system is pilot contamination. Reuse of the orthogonal pilot sequences in adjacent cells cause pilot contamination. Pilot contamination causes poor channel estimation at the BS and degrades the performance of the system. The proposed scheme improves the performance of downlink by optimized allocation of pilot sequences and using fractional frequency reuse factor (1/N). All the available pilot signals are equally divided among the cells as per the cluster size (N = 1, 3, 7). In the proposed scheme orthogonal pilot signal is transmitted by each user terminal to get the Channel State Information (CSI) to estimate the channel. SIR and terminal capacity for the downlink are calculated for the given number of user terminals using linear precoding (Matched Filter and Zero Forcing) schemes which are the function of the estimated channel and the pilot transmission power (ρp). It is observed that there is significant improvement in Pilot Signal to Interference Plus Noise (PSINR), SIR and terminal capacity by reducing fractional frequency reuse factor i.e. (N = 1, 3, 7).","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130743891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566557
Ankit Kumar, Kakali Chatterjee
Cryptography is essential to protect and secure data using a key. Different types of cryptographic techniques are found for data security. Genetic Algorithm is essentially used for obtaining optimal solution. Also, it can be efficiently used for random number generation which are very important in cryptography. This paper discusses the application of genetic algorithms for stream ciphers. Key generation is the most important factor in stream ciphers. In this paper Genetic Algorithm is used in the key generation process where key selection depends upon the fitness function. Here genetic algorithm is repeated for key selection. In each iteration, the key having highest fitness value is selected which further be compared with the threshold value. Selected key was unique and non-repeating. Therefore encryption with selected key are highly encrypted because of more randomness of key. This paper shows that the generated keys using GA are unique and more secure for encryption of data.
{"title":"An efficient stream cipher using Genetic Algorithm","authors":"Ankit Kumar, Kakali Chatterjee","doi":"10.1109/WISPNET.2016.7566557","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566557","url":null,"abstract":"Cryptography is essential to protect and secure data using a key. Different types of cryptographic techniques are found for data security. Genetic Algorithm is essentially used for obtaining optimal solution. Also, it can be efficiently used for random number generation which are very important in cryptography. This paper discusses the application of genetic algorithms for stream ciphers. Key generation is the most important factor in stream ciphers. In this paper Genetic Algorithm is used in the key generation process where key selection depends upon the fitness function. Here genetic algorithm is repeated for key selection. In each iteration, the key having highest fitness value is selected which further be compared with the threshold value. Selected key was unique and non-repeating. Therefore encryption with selected key are highly encrypted because of more randomness of key. This paper shows that the generated keys using GA are unique and more secure for encryption of data.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125491335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566440
M. Sundaravel, Himanshu Shekhar
A wideband printed slot antenna fed with fork like microstrip feed is presented. The proposed antenna is backed by a perfect metallic conductor (PEC) metal plate placed at a distance λg/4 from slot aperture ground plane to improve impedance bandwidth and gain over operating frequency range of 2.1 to 3.5GHz. The enhanced bandwidth of the antenna for a VSWR ≤ 2 is 58% and gain of the antenna is around 9dB over the band. Design and simulation results are presented and the antenna exhibits stable radiation pattern throughout the bandwidth.
{"title":"Low cross polarized wideband printed fork-like fed slot antenna","authors":"M. Sundaravel, Himanshu Shekhar","doi":"10.1109/WISPNET.2016.7566440","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566440","url":null,"abstract":"A wideband printed slot antenna fed with fork like microstrip feed is presented. The proposed antenna is backed by a perfect metallic conductor (PEC) metal plate placed at a distance λg/4 from slot aperture ground plane to improve impedance bandwidth and gain over operating frequency range of 2.1 to 3.5GHz. The enhanced bandwidth of the antenna for a VSWR ≤ 2 is 58% and gain of the antenna is around 9dB over the band. Design and simulation results are presented and the antenna exhibits stable radiation pattern throughout the bandwidth.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123741867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566220
V. Selvi, Ramdinesh, R. Shebin, Varunya
The Distributed Denial of Service (DDoS) attacks are a serious threat in today's Internet where packets from large number of compromised hosts block the path to the victim nodes and overload the victim servers. In the newly proposed future Internet Architecture, Named Data Networking (NDN), the architecture itself has prevention measures to reduce the overload to the servers. This on the other hand increases the work and security threats to the intermediate routers. Our project aims at identifying the DDoS attack in NDN which is known as Interest flooding attack, mitigate the consequence of it and provide service to the legitimate users. We have developed a game model for the DDoS attacks and provide possible countermeasures to stop the flooding of interests. Through this game theory model, we either forward or redirect or drop the incoming interest packets thereby reducing the PIT table consumption. This helps in identifying the nodes that send malicious interest packets and eradicate their actions of sending malicious interests further. The main highlight of this work is that we have implemented the Game Theory model in the NDN architecture. It was primarily imposed for the IP internet architecture.
分布式拒绝服务(DDoS)攻击是当今互联网的一个严重威胁，来自大量受损主机的数据包阻塞了通往受害节点的路径，并使受害服务器过载。在新提出的未来互联网架构NDN (Named Data Networking)中，该架构本身就有预防措施，以减少对服务器的过载。另一方面，这也增加了中间路由器的工作和安全威胁。我们的项目旨在识别NDN中被称为兴趣泛滥攻击的DDoS攻击，减轻其后果并为合法用户提供服务。我们已经为DDoS攻击开发了一个游戏模型，并提供了可能的对策来阻止利益泛滥。通过这个博弈论模型，我们可以转发或重定向或丢弃传入的兴趣包，从而减少PIT表的消耗。这有助于识别发送恶意兴趣包的节点，并进一步根除其发送恶意兴趣的行为。这项工作的主要亮点是我们在NDN架构中实现了博弈论模型。它主要适用于IP互联网架构。
{"title":"Game theory based mitigation of Interest flooding in Named Data Network","authors":"V. Selvi, Ramdinesh, R. Shebin, Varunya","doi":"10.1109/WISPNET.2016.7566220","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566220","url":null,"abstract":"The Distributed Denial of Service (DDoS) attacks are a serious threat in today's Internet where packets from large number of compromised hosts block the path to the victim nodes and overload the victim servers. In the newly proposed future Internet Architecture, Named Data Networking (NDN), the architecture itself has prevention measures to reduce the overload to the servers. This on the other hand increases the work and security threats to the intermediate routers. Our project aims at identifying the DDoS attack in NDN which is known as Interest flooding attack, mitigate the consequence of it and provide service to the legitimate users. We have developed a game model for the DDoS attacks and provide possible countermeasures to stop the flooding of interests. Through this game theory model, we either forward or redirect or drop the incoming interest packets thereby reducing the PIT table consumption. This helps in identifying the nodes that send malicious interest packets and eradicate their actions of sending malicious interests further. The main highlight of this work is that we have implemented the Game Theory model in the NDN architecture. It was primarily imposed for the IP internet architecture.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114447171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-15DOI: 10.1109/WISPNET.2016.7566224
A. Saha, B. Sau
A distance based network localization determines the positions of the nodes in the network subject to some distance constraints. The network localization problem may be modeled as a non-convex nonlinear optimization problem with distance constraints which are either convex or non-convex. Existing network localization algorithms either eliminate the non-convex distance constraints or relax them into convex constraints to employ the traditional convex optimization methods, e.g., SDP, for estimating positions of nodes with noisy distances. In practice, the estimated solution of such a converted problem gives errors due to the modification of constraints. In this paper, we employ the nonlinear Lagrangian method for non-convex optimization which efficiently estimates node positions solving the original network localization problem without any modification. The proposed method involves numerical computations. By increasing the number of iterations (not very high, usually less than hundred) in computations, a desired level of accuracy may be achieved.
{"title":"Network localization with noisy distances by non-convex optimization","authors":"A. Saha, B. Sau","doi":"10.1109/WISPNET.2016.7566224","DOIUrl":"https://doi.org/10.1109/WISPNET.2016.7566224","url":null,"abstract":"A distance based network localization determines the positions of the nodes in the network subject to some distance constraints. The network localization problem may be modeled as a non-convex nonlinear optimization problem with distance constraints which are either convex or non-convex. Existing network localization algorithms either eliminate the non-convex distance constraints or relax them into convex constraints to employ the traditional convex optimization methods, e.g., SDP, for estimating positions of nodes with noisy distances. In practice, the estimated solution of such a converted problem gives errors due to the modification of constraints. In this paper, we employ the nonlinear Lagrangian method for non-convex optimization which efficiently estimates node positions solving the original network localization problem without any modification. The proposed method involves numerical computations. By increasing the number of iterations (not very high, usually less than hundred) in computations, a desired level of accuracy may be achieved.","PeriodicalId":138911,"journal":{"name":"2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121737830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：