• OpenAccess
    • List of Articles Node

      • Open Access Article

        1 - Node to Node Watermarking in Wireless Sensor Networks for Authentication of Self Nodes
        Hassan Farsi Seyed Morteza Nourian
        In order to solve some security issues in Wireless Sensor Networks (WSNs), node to node authentication method based on digital watermarking technique for verification of relative nodes is proposed. In the proposed method, some algorithms with low computational for gener More
        In order to solve some security issues in Wireless Sensor Networks (WSNs), node to node authentication method based on digital watermarking technique for verification of relative nodes is proposed. In the proposed method, some algorithms with low computational for generation, embedding and detection of security ID are designed. The collected data packets by the nodes are marked using security ID. In the proposed method, header is used to mark the packets. Since the nature of the sensor networks is cooperative, using the head of the packets is proposed for authentication. Also using the marked head can prevent from sending and receiving fake data in the other nodes. Simulations have been performed in environments with imposing unrealistic data and having a probability from 1% to 10%. Comparing the proposed method with other methods shows that the proposed method in term of security, reducing traffic and increasing network lifetime is more effective. Manuscript profile
      • Open Access Article

        2 - Node Classification in Social Network by Distributed Learning Automata
        Ahmad Rahnama Zadeh meybodi meybodi Masoud Taheri Kadkhoda
        The aim of this article is improving the accuracy of node classification in social network using Distributed Learning Automata (DLA). In the proposed algorithm using a local similarity measure, new relations between nodes are created, then the supposed graph is partitio More
        The aim of this article is improving the accuracy of node classification in social network using Distributed Learning Automata (DLA). In the proposed algorithm using a local similarity measure, new relations between nodes are created, then the supposed graph is partitioned according to the labeled nodes and a network of Distributed Learning Automata is corresponded on each partition. In each partition the maximal spanning tree is determined using DLA. Finally nodes are labeled according to the rewards of DLA. We have tested this algorithm on three real social network datasets, and results show that the expected accuracy of presented algorithm is achieved. Manuscript profile
      • Open Access Article

        3 - A New Node Density Based k-edge Connected Topology Control Method: A Desirable QoS Tolerance Approach
        Mohsen Heydarian
        This research is an ongoing work for achieving consistency between topology control and QoS guarantee in MANET. Desirable topology and Quality of Service (QoS) control are two important challenges in wireless communication networks such as MANETs.In a Mobile Ad hoc Netw More
        This research is an ongoing work for achieving consistency between topology control and QoS guarantee in MANET. Desirable topology and Quality of Service (QoS) control are two important challenges in wireless communication networks such as MANETs.In a Mobile Ad hoc Network, MANET, nodes move in the network area; therefore, the network topology is randomly and unpredictably changed. If the network topology is not controlled properly, the energy consumption is increased and also network topology probably becomes disconnected. To prevent from this situation, it is necessary to use desirable dynamic topology control algorithms such as k-edge connectivity methods. This papertries to improvethe three following parameters according to the k-edge connectivity concepts: (1) network performance, (2) reduce energy consumption, and (3) maintain the network connectivity. To achieve these goals, as a new method, we enhance k-edge connectivity methods using an improved definition of node density. The new method is called as: Node Density Based k-edge connected Topology Control (NDBkTC) algorithm. For the first time the node density definition is dynamically used. The new method, computes the node density based on a new equation which consists of the following factors: the relative velocity of nodes, distance between nodes, the number of nodes and the transmission range of nodes. The results show that our new method improves the network performance compared with the existing methods. Also we will show that the new method can holds QoS in a desirable tolerance range. Manuscript profile
      • Open Access Article

        4 - Lifetime Improvement Using Cluster Head Selection and Base Station Localization in Wireless Sensor Networks
        maryam najimi Sajjad  Nankhoshki
        The limited energy supply of wireless sensor networks poses a great challenge for the deployment of wireless sensor nodes. In this paper, a sensor network of nodes with wireless transceiver capabilities and limited energy is considered. Clustering is one of the most eff More
        The limited energy supply of wireless sensor networks poses a great challenge for the deployment of wireless sensor nodes. In this paper, a sensor network of nodes with wireless transceiver capabilities and limited energy is considered. Clustering is one of the most efficient techniques to save more energy in these networks. Therefore, the proper selection of the cluster heads plays important role to save the energy of sensor nodes for data transmission in the network. In this paper, we propose an energy efficient data transmission by determining the proper cluster heads in wireless sensor networks. We also obtain the optimal location of the base station according to the cluster heads to prolong the network lifetime. An efficient method is considered based on particle swarm algorithm (PSO) which is a nature inspired swarm intelligence based algorithm, modelled after observing the choreography of a flock of birds, to solve a sensor network optimization problem. In the proposed energy- efficient algorithm, cluster heads distance from the base station and their residual energy of the sensors nodes are important parameters for cluster head selection and base station localization. The simulation results show that our proposed algorithm improves the network lifetime and also more alive sensors are remained in the wireless network compared to the baseline algorithms in different situations. Manuscript profile
      • Open Access Article

        5 - A Novel User-Centric Method for Graph Summarization Based on Syntactical and Semantical Attributes
        Nosratali  Ashrafi Payaman Mohammadreza Kangavari
        In this paper, we proposed an interactive knowledge-based method for graph summarization. Due to the interactive nature of this method, the user can decide to stop or continue summarization process at any step based on the summary graph. The proposed method is a general More
        In this paper, we proposed an interactive knowledge-based method for graph summarization. Due to the interactive nature of this method, the user can decide to stop or continue summarization process at any step based on the summary graph. The proposed method is a general one that covers three kinds of graph summarization called structural, attribute-based, and structural/attribute-based summarization. In summarization based on both structure and vertex attributes, the contributions of syntactical and semantical attributes, as well as the importance degrees of attributes are variable and could be specified by the user. We also proposed a new criterion based on density and entropy to assess the quality of a hybrid summary. For the purpose of evaluation, we generated a synthetic graph with 1000 nodes and 2500 edges and extracted the overall features of the graph using the Gephi tool and a developed application in Java. Finally, we generated summaries of different sizes and values for the structure contribution (α parameter). We calculated the values of density and entropy for each summary to assess their qualities based on the proposed criterion. The experimental results show that the proposed criterion causes to generate a summary with better quality. Manuscript profile