International Journals

Permanent URI for this collectionhttps://dspace.psgrkcw.com/handle/123456789/105

Browse

Filters

2014 - 20207

Settings

Author: search.filters.author.Nithya AStart date: 2012

Search Results

Now showing 1 - 7 of 7
  • No Thumbnail Available
    Item
    NODE WEIGHT SWALLOW SWARM OPTIMIZATION CONVEX NODE SEGMENTATION (NWS2CNS) ALGORITHM FOR DISTRIBUTED 3-D LOCALIZATION IN WIRELESS SENSOR NETWORKS (WSNS)
    (International Journal of Scientific & Technology Research (IJSTR), 2020-02) Nithya A; Kavitha A
    Localization is a significant part in the area of Wireless Sensor Networks (WSNs) with the purpose of has introduced important study significance between academia and research community. The task of establishing substantial manages of sensor nodes in WSNs is identified as localization or positioning and is a key issue in today’s communication systems toward approximation the position of starting point of events. On the other hand, localization is issue in huge scale 3-D WSNs appropriate toward the uneven topology, for example holes in the path, of the network. Recently, spatial convex node detection method is introduced by means of Convex Coverage Support Vector Machine (CCSVM) toward handle this issue. However in CCSVM classifier, Optimization the Number of Convex Pieces becomes extremely hard task. It turns into very hard designed for although minimizing or maximizing a quantity of known criteria or property in the computational geometry. Node Weight Swallow Swarm Optimization Convex Node Segmentation (NWS2CNS) is introduced in this work for handling optimization of number of convex pieces. NWS2CNS is proposed to minimize the number of convex pieces during network segmentation in huge scale 3-D WSNs. NWS2CNS is proposed for increasing higher location accuracy which is obtained by means of using a node inertia weight toward correctly computes the acceleration coefficients. High speed of convergence, solving local extremum, and increased localization accuracy are the advantages of proposed NWS2CNS algorithm. In NWS2CNS algorithm, segmental planes are able to be categorized by means of two steps: inside boundary region and outside boundary region. Once these two steps are optimized subsequently we expand the network segmentation correctly by means of decreased localization error. The proposed localization algorithm moreover is appropriate a new 3-D coordinate transformation algorithm, which helps decreases the errors proposed by means of coordinate integration among subnetworks and increase the localization correctness.
  • No Thumbnail Available
    Item
    ADVANCED CHAMFER DISTANCE BASED MULTIDIMENSIONAL SCALING (ACDMDS) ALGORITHM AND DISTRIBUTED 3-D LOCALIZATION IN WIRELESS SENSOR NETWORKS (WSNS)
    (Our Heritage, 2020-01) Nithya A; Kavitha A
    Correct localization in Wireless Sensor Networks (WSNs) is basic toward several applications. In general it becomes very difficult in huge scale 3D WSNs because of irregular topology since it consists of holes in the path, of the network. Node Weight Swallow Swarm Optimization Convex Node Segmentation (NWS2CNS) is introduced recently for solving 3D WSN accurate localization. However in NWS2CNS algorithm is not easy to recreate a global map by means of the relative coordinates subsequent to the network segmentation. So a number of advanced algorithms are needed to recreate the global map establishment. An Advanced Chamfer Distance Based Multidimensional Scaling (ACDMDS) algorithm is proposed in this paper in order to recognize relative localization designed for every approximate convex. The shortest hop count among two arbitrary neighboring nodes in the complete 3D WSN is able to achieve via the Floyd algorithm, and each and every one of these hop count distances is saved in a chamfer distance matrix. Chamfer distance is also additionally calculated to arbitrary neighboring nodes. After that spatial convex node detection algorithm and sub-optimal convex node algorithm have been also carryout individually. Simulation results demonstrate that the proposed ACDMDS technique be able to successfully segment a 3D WSN and considerably increase the localization results when compared to other existing methods. Simulation results are evaluated via the metrics like Localization Error Ratio (LER), Localized Node Proportion (LNP), Bad Node Proportion (BNP) and Network Coverage Ratio (NCR).
  • No Thumbnail Available
    Item
    CONVEX COVERAGE SUPPORT VECTOR MACHINE (CCSVM)CLASSIFIER AND DISTRIBUTED 3-D LOCALIZATION IN WIRELESS SENSOR NETWORKS(WSNS)
    (Journal of Adv Research in Dynamical & Control Systems, 2019-05) Nithya A; Kavitha A
    In wireless sensor networks (WSNs), accurate localization is the fundamental to various applications like geographic routing and position-aware data processing. It is challenging in the large scale 3-D WSNs because of the irregular topology, such as holes in the path, of the network. This work develops a distributed algorithm to acquire 3-D WSN localization. Hence to improve the 3-D WSN localization, the proposed work composed of two steps, segmentation and joint localization. Especially, the complete network is first divided into a number of sub networks by applying the approximate convex partitioning. A spatial convex node recognition method is developed by Convex Coverage Support Vector Machine (CCSVM) to support the network segmentation that relies on the connectivity information. Then, every sub network is accurately localized by with the multidimensional scalingbased algorithm. The proposed localization algorithm uses a new 3-D coordinate transformation algorithm that helps to reduce the errors introduced by coordinate integration between sub networks and improve the localization accurateness. Results using broad simulations, exhibit that the ICCSVM system to segment a complex 3-D sensor network successfully and significantly increases the localization rate when compared with existing methods.
  • No Thumbnail Available
    Item
    LOCALIZATION TECHNIQUE CONSIDERING POSITION UNCERTAINTY OF REFERENCE NODES IN WIRELESS SENSOR NETWORKS
    (International Journal for Scientific Research and Reviews (IJSRR), 2019-01-10) Nithya A
    paper proposes a distributed localization algorithm in wireless sensing element networks. The formula considers the position uncertainty of reference nodes, that are unnoticed within the past analysis, within which imperfect position info of reference nodes intensifies the error accumulation development. The formula calculates position uncertainty by the dilution of preciseness and presents a balance purpose between varies errors and position errors by applying the changed spring mass methodology. It has a tendency to verify the practicableness of the planned formula by dynamical multiple parameters below numerous circumstances. The result proves that the general performance of localization is increased by considering the position uncertainty.
  • No Thumbnail Available
    Item
    AN ANALYSIS OF MANET AND VANET ROUTING PROTOCOLS
    (International Journal for Science and Advance Research in Technology (IJSART), 2018-02-02) Nithya A
    MANET and VANET square measure the active analysis areas and plenty of routing protocols have been planned to be used in these areas. In MANET, nodes square measure connected through wireless channels in an exceedingly network and every node acts as a router and as a number. One among the situation of Manet is transport ad-hoc networks. For communication in VANET, efficient Routing Protocols square measure required. attributable to extremely dynamical configuration and frequent disconnection it's strenuous to style Associate in Nursing economical routing protocol for vehicles, there will be 2 sorts of VANET that square measure V2V(Vehicle to Vehicle) and V2RSU(Vehicle to Road aspect Unit). As a result of daily happening of accidents VANET is one of the affecting areas for the refinement of Intelligent Transportation System (ITS) that will insure passengers and road safety. The Intelligent Transport Systems provides info if there exists any emergency and tells regarding traffic density. The traffic and traffic density. The prevailing routing protocols for VANET aren't economical enough to satisfy all traffic situations. Worthy routing protocols square measure needed to initiate communication between vehicles in future for passengers and road safety. This paper shows literature survey associated with Reactive and Proactive Routing Protocols of MANET as AODV, DSDV, OLSR, and DSR. Analysis and characterization of those protocols is shown within the paper which helps in any improvement of existing routing protocols
  • No Thumbnail Available
    Item
    ROUTING MISBEHAVIOR DETECTION IN MANET USING 2ACK
    (International Journal of Innovative Computer Science & Engineering (IJICSE), 2017-05) Nithya A
    Data security and privacy protection with resource efficiency are the major challenging tasks of wireless Networks. Due to high mobility, untrusted nature is the major challenges faced in mobile networks. Packet dropping and modifications are also common attacks that can be launched by an adversary to disrupt communication in wireless networks. Many schemes have been proposed to mitigate, prevent and tolerate such attacks, but very few can efficiently identify the attackers. Even those schemes could find after the attacks done. Those type of schemes used packet marking techniques to investigate and verify the security issue. The type of implementation is not considered the communication and energy overhead. To address these issues, the proposed system introduces a simple yet effective scheme, which can identify misbehaving forwarders and routes that drop or modify packets. Networks, Encryption; security, Permutation. The proposed system also considers the other type of security issues, in order to identify and prevent the data from unauthorized forwarders, the system proposed a new protocol which is named as ACT (Anonymous Concealed data Transmission). The proposed system utilizes several techniques to protect, prevent and avoid routing misbehaving attacks. In order to identify and block the nodes which tries to drop or modify the data, the proposed system has been implemented the key bit verification algorithm. The procedure behind the proposed system is to identify the key and its value of every packet with concealed data transmission. The proposed system demonstrates that ACT can well protect user data against both inside and outside attackers.
  • No Thumbnail Available
    Item
    CLUSTERING IN WIRELESS SENSOR NETWORKS: A SURVEY
    (International Journal of Computer Trends and Technology (IJCTT), 2014) Nithya A; Sasikala M
    Wireless Sensor network (WSN) has emerged as a useful supplement to the modern wireless communication networks. Most suitable option of ways for information transfer finally ends up in saving of energy consumption resulting in increase of network lifetime of Wireless device Networks. Many routing, authority board, and information dissemination protocols area unit specifically titled for WSNs where energy awareness is a vital style issue. Routing protocols in WSNs may dissent reckoning on the appliance and specification as there is still no agreement on a tough and quick communication stack for WSN. Newer Routing protocols area unit required to cater to the requirement of present and pervasive computing. In this paper, WSN Routing Protocols has been classified in four ways in which i.e., routing ways establishment, network structure, protocol operation and leader of communications. Further, routing protocols area unit classified on the thought of their homogeneity and non uniformity of device nodes followed by the factors of clustered and non -clustered among every. Information aggregation, support for question and quality of the network of these routing protocols have what is more been.