BOUNDARY DETECTION USING DISTRIBUTED BOUNDARY ESTIMATION ALGORITHM IN CONGNITIVE RADIO NETWORKS

(1)

ISSN: 2005-4238 IJAST 117

BOUNDARY DETECTION USING DISTRIBUTED BOUNDARY ESTIMATION ALGORITHM IN CONGNITIVE RADIO NETWORKS

1Sivagurunathan P.T, ²Ramakrishnan.P, ³Dr.N.Sathishkumar

1Senior Assistant Professor, ²Assistant Professor Department of Electronics and Communication Engineering,

1,2M.Kumarasamy College of Engineering, Karur, Thalavapalayam, Karur, Tamil Nadu

3Professor, Department of Electronics and Communication Engineering,

3Sri Ramakrishna Engineering college, Coimbatore, Tamil Nadu

Abstract

In a cognitive radio system, the spectrum shares its information among its primary user (PU) and secondary user (SU). While sharing the spectrum among the users interference problem may arise. In this paper we are discussing about the problem in primary user while estimating the senseless area which means that the secondary user may uses the primary user spectrum without consider whether primary user is transmitting or not. In our proposed work we discuss the boundary estimated algorithm. This algorithm may determine the boundary of primary user and secondary users to utilize the spectrum in efficient way. By using boundary estimated algorithm the secondary users will measures the boundary of no-talk area. The boundary is calculated by secondary users by transfers the message among them and measuring the trade-off in estimation error, examines throughput and communication cost, arrangement complexity and robustness. This algorithm helps to improve the communication tradeoff value and estimation performance value. The performance estimation value by using boundary estimated algorithm is better than other algorithms. Error in spectrum sensing is minimized by using this technique. The communication cost is high when compared with least square support vector machine algorithm.

Key terms: Cognitive Radio, distributed boundary estimation, spectrum sharing, spectrum sensing.

I. INTRODUCTION

An cognitive radio (CR) arrange enhances broadcasting range use by allowing unauthorized auxiliary clients to get to a similar range when the authorized essential clients are not utilizing it, or when secondary user transmissions do not meddle essentially with the primary user . Different range detecting strategies have been proposed, including concentrated [1], appropriated [2] and transfer helped agreeable location plans [3]. We analyze the spatial utilization assorted variety of primary user by giving the primary user a chance to settle an obstruction temperature limit. If the primary user of a channel does not transmit any information then the secondary user will transmit in no-talk region.

If the secondary user may present beyond the no-talk region then it will transmit the data without considering whether primary user is transmitting or not. Our primary objective is to build up a disseminated calculation that enables secondary users to helpfully decide the limit of the no-talk area.

Diverse range sharing area, including an essential selective area and the no-talk area [4] are characterized. In any case, every one of these works accepts that the proliferation way misfortune between the primary user and secondary user are isotropic, and all areas are thought to be around.

Limits on the sweep of every locale are given dependent on obstruction and blackout contemplations, which are described as far as spread parameters like way misfortune examples. By and by, the spread condition may be extremely hard to display value, and senseless district was probably not going to be round. Hence, we create limit inference techniques for the senseless region does not depend upon broad suspicions about state of the locale. Limit inference is generally utilized in various sensor organizing appliances. Techniques dependent on hub degrees [5], availability data [6], and topology data [7] have been proposed to gauge the inclusion area of a sensor organize. Despite the fact that the meaning of a no-talk district was thoroughly tended to little work has been done to assess the limit of this area.

(2)

ISSN: 2005-4238 IJAST 118

Fig.1 Spectrum sharing between the primary user and secondary user

A classifier-based limit identification calculation for evaluating the no-talk area utilizes the support vector machines (SVM) algorithm. The spectrum sharing among the primary user with multiple secondary user is shown in fig.1. A computational geometry technique dependent on arched frames has likewise been used for limit estimation. Let us consider the fusion center receives the information from sensors so that the boundary estimation process takes place at fusion center. Because of the energy and bandwidth constraints in a cognitive system the secondary user was limited to have a communication with fusion center. Limited edge location calculations dependent on measurable, picture preparing and characterization strategies were discussed in [8] which permits a sensor to locally choose whether or not it is situated on or close a limit. The Bayesian calculation has additionally been planned to decide occasion areas. These strategies anyway don't make utilization of participation among the sensors. A progressive tree-based estimation technique utilizing recursive dyadic apportioning [9] and a dynamic limit following calculation that joins spatial and transient estimation strategies [10] have been exposed for limit evaluation in adhoc systems. Notwithstanding, this technique is again brought together, and could not think about the smoothness of an assessed limit. We examine the agreeable estimation of the primary user no-talk area as a result of abusing neighborhood interchanges among secondary users. Our fundamental commitments are the accompanying:

1) We propose a dispersed limit estimation technique in view of the conveyed learning system and with extra smoothness imperatives. The secondary user allows to transmit even primary user is transmitting when the sensors are present away from the no-talk area.

2) We give surmised theoretical limits to the correspondence cost caused by our proposed method and the predictable evaluation mistake, so the inexact ideal secondary user thickness can be gathered. This is valuable for arbitrarily designating secondary users to gauge the no-talk areas of transmitting over various recurrence groups. We take note of that our theoretical execution examination should not be considered.

3) The setup complexity for proposed method should be calculated along with that the throughput value obtained by the primary user and secondary users should also be examined.

4) With the help of simulation result we can say that the boundary estimation algorithm has good throughput value and setup complexity is less when compared to other boundary detection algorithm.

This algorithm is more robust to secondary user sensing error so that communication cost may increase.

(3)

ISSN: 2005-4238 IJAST 119

The boundary estimation algorithm will utilize the spectrum in efficient way with high throughput value though it has more communication cost. And one more advantage of using this algorithm is that setup complexity is low. Overall system throughput value is high. Remaining part of this paper is organized as follows. The cognitive system used in the IoT explained in [11]. In that the cognitive radio networks utilize the spectrum and the electrical devices are constant. Section II explains about the boundary estimation algorithm. Next section discuss about the simulation results with their parameter. Finally, the conclusion of this paper is discussed.

II. DISTRIBUTED BOUNDARY ESTIMATION

We propose a circulated limit estimation calculation in this paper that decides the limit of the set 𝑅 dependent on communication going among the secondary users. Secondary users are gathered into groups, and many correspondences are more than moderately little runs inside groups. Every group should have a secondary user that fills in as the group leader. The group leader speaks with secondary users within its group, achieves the majority of the important calculations essential for circulated evaluation of the limit, as well as imparts with additional group leaders. Group leaders along these lines use more vitality than run of the mill secondary users within the group. Motivators should be intended to remunerate group leaders; a precedent being given higher need to get to the range. Such motivating force components are not in the extent of our existing performance so it should not talked here. Our appropriated limit evaluation method comprises some accompanying advances.

A. Creation of group:

Every secondary user autonomously designates itself to be a group head with likelihood 𝑝_ℎ. A group head communicates a information over a control channel to all secondary users inside the separation 𝛿 to educate them with their incorporation into the bunch. In order to maintain a strategic distance from crashes among bunch heads, a bearer sense different access convention is utilized. Note that a group head can likewise have a place with another group, and a secondary user can have a place with numerous groups.

B. Boundary recognition of group:

Let structure the measurement to recognize the above mentioned groups may occurs near the limit belongs to the set 𝑅 . These are identified as boundary recognized groups. Here we discuss the boundary recognition of group in detail.

Give 𝐶 a chance to be a group, and 𝑢⁻= _|𝑐|¹ ∑_𝑖∈𝑐1{𝑢_𝑖 = −1}U− = 1 |C| to be the division of secondary user in group 𝐶 with 𝑢_𝑖 = −1. The groups inside 𝑅 has higher likelihood of 1 − 𝑢⁻ is more bigger than 𝑢⁻, even the primary users are far away the reciprocal process is exact for the groups. In order to distinguish the group mentioned above near to the limit of 𝑅 , we let 𝑆 = max( 𝑢⁻, 1 − 𝑢⁻) and suggest that 𝐶 was limit bunch and just if 𝑆 ≤ 𝛾, where 𝛾 to be a settled edge.

In the event that 𝐶 isn't a limit bunch, the group head pronounces it to be within 𝑅 if 𝑢⁻< 1 2⁄ , and farther the other way around. In previous section those groups are belongs to inside groups but in the last section the groups are se=aid to be outside group. Notations used in this process are given in table I.

(4)

ISSN: 2005-4238 IJAST 120

Table I

Symbols and their definition

Distributed boundary estimation:

Information was traded among individuals from the limit bunch and their group leader. Likewise, information was traded among group leader of nearby limit groups to cooperatively assess the limit of 𝑅. Here we discuss the distributed boundary estimation process in detail.

The latest secondary user location 𝑥 may present in 𝑅 or it may not. For this secondary user location we should know about the function . In order to learn about the function the following method is used. The secondary user on area 𝑥 questions and the group goes towards verify the kind of group it has a place with (review that a SU may have a place to various bunches). In the event that it has a place within its group, if 𝑓(𝑥) = 1 and announce that it has a place with 𝑅. On the off chance that it doesn't have a place with any inside groups, and it has a place with a limit group, it utilizes a neighborhood work, which we depict beneath, to decide its area status. At last, in the event that it isn't inside any within or limit groups, if 𝑓(𝑥) = −1, and pronounce that a secondary user should be in 𝑅^𝑐. Assume 𝐵 = {𝐶₁, . . . , 𝐶_𝑀} be the arrangement of limit groups. The limit groups cooperatively gauge the limit of R in light of nearby data and message trades between group heads. We utilize the duplicating bit Hilbert space definition to acquire a capacity that recognizes an area 𝑥 may present in 𝑅 or it may not. Be that as it may, since we don't expect that here is a focal expert to carry out the evaluation, we consider rather deciding an accumulation {𝑓𝐶 _𝑗} of nearby capacities, each comparing to a limit group. On the off chance that x isn't inside an inside group and it has a place with a limit group, we may have the evaluation work 𝑓(𝑥) chooses the rate 𝑓𝐶(𝑥) where 𝐶 is picked arbitrarily since the arrangement of limit groups carrying 𝑥.

Suppose 𝐻_𝐾 be a reproducing Hilbert space relating to the portion 𝐾 which may fills in as comparability calculate among both the secondary areas. We limit near bits which were Radial Basis Function in which the parts that can be communicated as elements of the Euclidean separation between two secondary user areas. For each 𝐶_𝑗 ∈ ℬ, let 𝑁(𝐶_𝑗) be the arrangement of records 𝑘 with 𝑗 ≠ 𝑘 and |𝐶_𝑘 ∩ 𝐶_𝑗 | ≠ 0. We call those bunches in 𝑁(𝐶_𝑗) the neighboring groups of 𝐶_𝑗. The main objective is

𝑚𝑖𝑛 ∑_{𝑖∈𝑈 𝑀 𝐶}_𝑗(𝑍_𝑖− 𝑢_𝑖)²

𝑗=1

+ ∑^𝑀_𝑚=1𝑣_{𝑚 ‖𝑓𝐶}_𝑚_‖²_𝐻_𝑘+ ∑^𝑀_𝑚=1∑_{𝑘∈𝑁(𝐶}_𝑚₎η_𝑚𝜖²_𝑚,𝑘 (1) Symbol Definition

𝑅 no-talk region of Primary User

𝑁 No. of. secondary user in area of interest A 𝛿 performance range of a Secondary User 𝑝_ℎ probability of a secondary user to become

a group leader

𝛾 threshold to establish if a group is a boundary group

𝑀 No. of. boundary group

𝐶𝑗 jth boundary group, 𝑗 = 1, . . . , 𝑀 ℬ set of boundary group {𝐶1, . . . , 𝐶𝑀}

𝑁(𝐶_𝑗) set of nearby groups of 𝐶_𝑗

𝑓𝐶 _𝑗 local boundary estimation function of group 𝐶_𝑗

(5)

ISSN: 2005-4238 IJAST 121

focus to

𝑓𝐶_𝑚 ∈ 𝐻_𝑘 , ∀ 𝐶_𝑚 ∈ ℬ, (2) 𝑍_𝑖 = 𝑓𝐶_𝑚 (𝑥_𝑖) , ∀ 𝑖 ∈ 𝐶_𝑚 , 𝐶_𝑚 ∈ ℬ, (3) 𝜖_𝑚,𝑘 = _|𝐶¹

𝑚| ∑ 𝑓𝐶_𝑚 (𝑥_𝑖) − _|𝐶¹

𝑘|

𝑖∈𝐶_𝑚 ∑_𝑖∈𝐶_𝑘𝑓𝐶_𝑘 (𝑥_𝑖) , ∀ 𝑘 ∈ 𝑁(𝐶_𝑗), 𝐶_𝑗∈ ℬ, (4) where ‖. ‖𝐻_𝑘 is the standard of 𝐻_𝑘, and 𝑣_𝑚, η_𝑚, for 𝑗 = 1, . . . , 𝑀 , are certain constants. The equation (1) is minimized to all the factors 𝑍_𝑖, 𝑓𝐶_𝑚 and 𝜖_𝑚,𝑘. The limitations (2) require that the nearby classifier 𝑓𝐶_𝑚 from every limit bunch 𝐶_𝑚 is looked over the Hilbert space 𝐻_𝑘. The imperatives (3) guarantee that if a secondary user has a place with various limit groups, the characterization result continues as before paying little mind to the neighborhood classifier utilized.

At last, the requirements (4) guarantee that the assessed limit is smooth.

Suggestion 1: For every 𝐶_𝑚 ∈ ℬ, the ideal answer for the minimization issue (4) is given by 𝑓^∗𝐶_𝑚 (𝑥) = ∑_𝑖∈𝐶_𝑚ℬ_𝑚,𝑖𝐾(𝑥, 𝑥_𝑖).

Moreover, if the part 𝐾 is an outspread premise work, the calculation of 𝑖 ∈ 𝐶_𝑚 (𝑥) requires just information of ‖𝑥 − 𝑥_𝑖‖, for all 𝑖 ∈ 𝐶_𝑚. From (4) along with suggestion 1, we should prepare the classifier for a group 𝐶_𝑚 ∈ ℬ, so let us have the group make a beeline for know ‖𝑥_𝑖− 𝑥_𝑗‖, for all 𝑖, 𝑗 ∈ 𝐶𝑚. This can be gotten utilizing different going strategies. Models incorporate techniques in that every secondary user 𝑖 communicates a direct motion through identified transmit power, otherwise trade communicates with time stamps. The appropriated limit evaluation calculation may properly expressed in Calculation 1 is known as distributed boundary estimation calculation.

The accompanying recommendation demonstrates that the classifiers in the distributed boundary estimation calculation may combine.

Suggestion 2: For every 𝐶_𝑚, where 𝑚 = 1, . . . , 𝑀, the succession 𝑓_𝐶^𝑡_𝑚 of the distributed boundary estimation calculation combines as amount of cycles t → ∞.

Confirmation: Given that each Λ_𝑚 is a shut subspace of 𝐻, also their convergence Λ = ∩_𝑚Λ_𝑚 is ineffective. The distributed boundary estimation calculation is introduced expect that limit group heads are synchronized with the goal that neighborhood calculations can be executed consecutively.

We note nonetheless that it is as yet conceivable to accomplish union if subsequent a limit group leader has played out its neighborhood calculation, it arbitrarily picks a nearby limit group go to exceed data. The picked nearby group leader at that point rehashes a similar method. We consider this the randomized distributed boundary estimation calculation. Give 𝒢 a chance to exist the chart with vertex set ℬ, that may have an edge among 𝐶_𝑖 and 𝐶_𝑗in the event that they are neighboring groups.

We have the accompanying union outcome.

Recommendation 3: Let us have 𝐾(𝑢, 𝑢) ≤ 𝑘² for all 𝑢 ∈ 𝐻𝑘, furthermore, 𝒢 was associated. The evaluation mistake in the randomized distributed boundary estimation calculation combines to 𝐸[(𝑓^∗(𝑋) − 𝑈)²].

Confirmation: Let 𝑓𝑛be the estimation work at the n-th calculation of the randomized distributed boundary estimation calculation. Since G is associated, the irregular arrangement of picked group heads is a final furthermore, repetitive Markov chain with the goal that each group head shows up endlessly frequently in the irregular succession. The arrangement 𝑓_𝑛is feebly joined to an ideal estimation work f∗. Since pitifully united arrangements are limited, we have |𝑓_𝑛(𝑥)| ≤

(6)

ISSN: 2005-4238 IJAST 122

‖𝑓_𝑛‖_𝐻_𝐾 √𝐾(𝑥, 𝑥) ≤ 𝑘‖𝑓_𝑛‖_𝐻_𝐾 is limited. Since the ruled assembly hypothesis and the recreating property of 𝐻𝐾, we get

𝑛→∞lim 𝐸[(𝑓_𝑛(𝑋) − 𝑈)²] = 𝐸 [ lim

𝑛→∞(〈𝑓_𝑛, 𝐾(. , 𝑋)〉𝐻_𝐾− 𝑈²)] (5) =𝐸 lim

𝑛→∞[(𝑓^∗(𝑋) − 𝑈)²] (6)

III. EXPERIMENTAL RESULTS

Initially the tradeoff among communication cost and estimation error in distributed boundary estimation algorithm is discussed in this section. Next, the setup complexity and their throughput values are examined.

A. Communication cost and estimation error

Let us analyze the correspondence cost brought about as well as the evaluation execution of the distributed boundary estimation calculation among the different specific calculations, involving the accompanying:

1) Centralized limit evaluation calculation dependent on Least-square support vector machine: a worldwide classifier is prepared dependent on data from all secondary users in the limit groups.

2) Centralized picture handling based seeded region growing calculation: we respect the choice 𝑢_𝑖of each secondary user 𝐼 as the pixel dim dimension in a twofold picture as well as the picture with developing an area as of a seed point utilizing a power mean calculate.

3) Distributed Bayesian event region detection calculation: a limit choice plan is connected to address the blunders of neighborhood secondary user choices.

The estimation execution is standardized by multiple times the region of 𝑅. Because the evaluation work f takes esteems near 1 or −1, the standardized evaluation mistake is around the region in which misclassification happens, communicated as a small amount of the territory of 𝑅. The correspondence cost is figured by expecting that every message goes among two secondary users a separation r separated causes a cost 𝑜𝑓 𝑔(𝑟) = 𝑟².

Fig.2 Graph between communication cost and estimation error (𝛾 = 0.6)

(7)

ISSN: 2005-4238 IJAST 123

Fig.2 demonstrates the standardized estimation mistake and correspondence cost for every calculation while picking unique values for ph, which is the likelihood that each secondary user freely assigns itself to be a bunch head. The edge γ in the limit group choice principle is set to be 0.6. As ph expands, the execution of the seeded region growing furthermore, edge region detection calculations stay steady as these calculations don't utilize grouping. The execution of our proposed distributed boundary estimations calculation then again, turns out to be superior to the seeded region growing and the edge region detection calculations, yet fails to meet expectations the concentrated least- square support vector machine calculation. Unified techniques like least- square support vector machine and seeded region growing anyway have higher correspondence costs than the edge region detection what's more, distributed boundary estimation calculations as just small vary correspondences are essential for the last calculations.

Fig.3 Graph between communication cost and estimation error (𝑝_ℎ= 0.8)

The distributed boundary estimation calculation accomplishes ostensibly the best interchange among the estimation mistake and correspondence cost but 𝑝_ℎ was decided to be adequately expansive. Let us presently locate the likelihood 𝑝_ℎ = 0.8 and change the edge γ in the limit group choice principle, which has more estimation of γ relating to extra bunches has been picked as the limit bunches. Fig.3 shows that despite the fact that the evaluation mistake diminishes along with expanding γ, the rate of abatement isn't exceptionally huge. This is on the grounds that the majority of the real limit groups have just been incorporated for sensible estimations of γ.

Fig. 4 Summation of communication cost and estimation error with variable secondary user

(8)

ISSN: 2005-4238 IJAST 124

After that set the value as 𝑝_ℎ = 0.8 and 𝛾 = 0.6, change the secondary user thickness from 5 to 160 secondary user per 𝑘𝑚². We utilize reproduction to the register whole correspondence cost also evaluation mistake weighted by 𝛽 is shown in fig.4.

B. Throughput

Fig.5 explains in change the recognition likelihood and design a primary user throughput versus the throughput per secondary user in cooperation with Distributed Boundary Estimation- Spectrum Sensing furthermore, fusion center strategies. The throughput per secondary user for the Distributed Boundary Estimation- Spectrum Sensing technique is generally flat on the whole primary user throughputs as secondary users away from no-talk region 𝑅̂ can transmit paying little mind to whether the PU is available or not. Then additionally observe that secondary user throughput is more than the fusion center strategy. Fig.6 demonstrates the normal secondary user throughput when the primar y user throughput is settled at 4 bits/sec/Hz, and the capacity of 𝐴 is reduced. From this it clear that the Distributed Boundary Estimation- Spectrum Sensing strategy must as it were be utilized if 𝐴 is over 10% bigger than 𝑅.

Fig.5 Throughput between PU and SU

Fig.6 Average SU throughput when value of A changes

(9)

ISSN: 2005-4238 IJAST 125

C. Robustness

We presently look at the power of the different limit estimation calculations. We settle ph = 0.8 and γ

= 0.6. To recreate SU detecting mistakes, a limit group is haphazardly picked with likelihood ς, and afterward an irregular subset of the secondary user detecting choices in the picked group is changed from −1 to 1, while an equivalent number of secondary user detecting choices is changed from 1 to

−1. The smoothing and non smoothing constraints results are shown in figure.7.

Fig.7 Robustness with smoothing and non smoothing constraints IV. CONCLUSION

We have built up a boundary detection estimation calculation for evaluating the senseless area of primary user in the psychological radio system also dissected the exchange offs among the correspondence rate and evaluation blunder of our planned strategy. Let us infer rough upper limits for the correspondence rate and evaluation blunder which gives strategy to process an ideal secondary user thickness. Reenactment result shows that our planned calculation have brings down evaluation blunders as well as improved strength contrasted with different techniques. We have made different rearranging and heuristic suspicions in inferring the ideal SU thickness. Our recreations may demonstrates in spite of these suppositions, the hypothetical ideal SU thickness found isn't fundamentally not the same as the real one. Jumping the estimation blunder all the more decisively ruins a troublesome unwrap issue. By using this algorithm it is clear that the primary user is stationary one as well as the interference received by the secondary user at primary user may not vary after some point. In future, the boundary estimation algorithm should determine the boundary when primary user is at moving state with time variant of communication among secondary user.

REFERENCES

1. J. Unnikrishnan and V. V. Veeravalli, “Cooperative sensing for primary detection in cognitive radio,” IEEE J. Sel. Topics Signal Process., vol. 2, no. 1, pp. 18–27, 2008.

2.

3. [Z. Li, F. R. Yu, and M. Huang, “A cooperative spectrum sensing consensus scheme in cognitive radios,” in Proc. IEEE 28th Annual Joint Conf. of the IEEE Computer and Communications Societies, 2009, pp. 2546–2550.

(10)

ISSN: 2005-4238 IJAST 126

4. W. Zhang and K. Letaief, “Cooperative spectrum sensing with transmit and relay diversity in cognitive radio networks,” IEEE Trans. Wireless Commun., vol. 7, no. 12, pp. 4761–4766, 2008.

5. M. Vu, N. Devroye, and V. Tarokh, “On the primary exclusive region of cognitive networks,”

IEEE Trans. Wireless Commun., vol. 8, no. 7, pp. 3380–3385, 2009.

6. S. P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann, “Neighborhood-based topology recognition in sensor networks,” in Proc. 1st Int. Workshop on Algorithms for Sensor Systems, 2004, pp. 123–136.

7. R. Ghrist and A. Muhammad, “Coverage and hole-detection in sensor networks via homology,” in Proc. 4th Int. Symp. Information Processing in Sensor Networks, 2005, pp.

254–260.

8. Y. Wang, J. Gao, and J. S. Mitchell, “Boundary recognition in sensor networks by topological methods,” in Proc. 12th Annual Int. Conf. on Mobile Computing and Networking, 2006, pp.

122–133.

9. K. K. Chintalapudi and R. Govindan, “Localized edge detection in sensor fields,” in Proc.

IEEE 1st Int. Workshop on Sensor Network Protocols and Applications, 2003, pp. 59–70.

10. R. Nowak and U. Mitra, “Boundary estimation in sensor networks: Theory and methods,” in Proc. Information Processing in Sensor Networks, 2003, pp. 80–95.

11. S.Palanivel Rajan, T.Dinesh, “Systematic Review on Wearable Driver Vigilance System with Future Research Directions”, International Journal of Applied Engineering Research, Vol. 2, Issue 2, pp.627-632, 2015.

12. S.Palanivel Rajan, S.Vijayprasath, “Performance Investigation of an Implicit Instrumentation Tool for Deadened Patients Using Common Eye Developments as a Paradigm”, International Journal of Applied Engineering Research, Vol.10, Issue 1, pp.925-929, 2015.

13. S.Palanivel Rajan, C.Vivek, M.Paranthaman, “Feasibility Analysis of Portable Electroencephalography Based Abnormal Fatigue Detection and Tele-Surveillance System”, International Journal of Computer Science and Information Security, ISSN No.: 1947-5500, Vol. No.: 14, Issue : 8, pp. 711-722, 2016.

14. P.T.Sivagurunathan, P.Ramakrishnan,” A Survey on Wearable health Sensor– Based System Design” , International Journal of Pure and Applied Mathematics, Online ISSN No.: 1314- 3395, Print ISSN No.: 1311-8080, Vol. No.: 118, Issue No.: 08, pp. 383 - 385, 2018. (SCOPUS).

15. S.Palanivel Rajan, “Diagnosis of Cardiovascular Diseases using Retinal Images through Vessel Segmentation Graph”, Current Medical Imaging Reviews, Online ISSN: 1875-6603, ISSN: 1573-4056, Vol. : 13, Issue :4, DOI : 10.2174/1573405613666170111153207, 2017.

16. S. Duttagupta, K. Ramamritham, and P. Kulkarni, “Tracking dynamic boundaries using sensor network,” IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 10, pp. 1766–1774, 2011.

17. S. Tozlu, M. Senel, W. Mao, and A. Keshavarzian, “Wi-fi enabled sensors for internet of things: A practical approach,” IEEE Commun. Mag., vol. 50, no. 6, p p. 134–143, 2012 18. M Paranthaman, G.Shanmugavadivel “Design of Frequency Reconfigurable E-Shaped Patch

Antenna for Cognitive Radio” International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 10 No.20 (2015) pp.16546-16548

(11)

ISSN: 2005-4238 IJAST 127

19. Paranthaman, M., S. Palanivel Rajan (2018) Design of E and U Shaped Slot for ISM Band Application Indian Journal of Science and Technology, Vol 11(18), DOI: 10.17485/ijst/2018/

v11i18/123042

20. Paranthaman, M., and S. Palanivel Rajan. "Design of Triple C shaped Slot Antenna for Implantable Gadgets." Current Trends In Biomedical Communication And Tele–

Medicine (2018): 40. DOI: 10.21786/bbrc/11.2/6

21. V.Kavitha, V.Palanisamy, “New Burst Assembly and Scheduling T technique for Optical Burst Switching Networks”, Journal of Computer Science, Vol. 9, Issue 8, pp.1030-1040, 2013.

22. P.Ramakrishnan, “Survey Paper on PAPR Reduction in MIMO-OFDM Systems”

International Journal of Applied Engineering Research, Vol.10 Page no:19234-19238, March 2015.

23. M Paranthaman, S Vijayprasath, S Palanivel Rajan “Design of a Frequency Tunable Patch Antenna using HFSS”, International Journal of Advanced Research Trends in Engineering and Technology, Vol.3, Issue 7 (2016) pp.69-72

24. C.Vivek, S.Palanivel Rajan, “Design of Data Aware Low Power Area Efficient Data paths for Processing Elements in a Reconfigurable System”, International Journal of Computer Science and Information Security, ISSN : 1947-5500, Vol.14, Issue 9, pp. 1100- 1113, 2016.

25. S.Palanivel Rajan, T.Dinesh, “Analysis of Human Brain Disorders for Effectual Hippocampus Surveillance”, International Journal of Modern Sciences and Engineering Technology, Vol. 2, Issue 2, pp.38-45, 2015.