List of Articles Node

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Improving imperialist competitive algorithm for solving the nodes placement problem in three-dimensional grid wireless sensor networks
  Sayed Wafa Barkhoda Hemmat Sheikhi sudabeh mohammadi
  One of the basic and important research fields in wireless sensor networks is how to place sensor nodes where by using minimum number of sensor nodes all target points are covered and all sensor nodes are connected to the sink. In this paper, a novel method based on imp More

  One of the basic and important research fields in wireless sensor networks is how to place sensor nodes where by using minimum number of sensor nodes all target points are covered and all sensor nodes are connected to the sink. In this paper, a novel method based on imperialist competitive algorithm is used for solving the mentioned problem. In the proposed method, a colony can immigrate from a weak empire to more powerful empire. The idea of immigration is inspired from human society in which a human can emigrate from a country to another country. The network is supposed to be a three-dimensional grid network and the sensor nodes can be only placed at cross-points of the grids while the target points can be deployed at each point of three-dimensional space. The simulation results show that the proposed method uses fewer number of sensor nodes than other similar algorithms and has the less running time. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Increasing the lifetime of underwater acoustic sensor networks by optimal relay node placement
  zahra mihamadi mohadeseh soleimanpour daryush avasimoghaddam Siamak Talebi
  Underwater acoustic sensor networks (UASNs) have gained growing importance due to their desirable features and wide spread practical applications in many communication fields. Due to the high cost of underwater sensor nodes as well as implementation complexity, increasi More

  Underwater acoustic sensor networks (UASNs) have gained growing importance due to their desirable features and wide spread practical applications in many communication fields. Due to the high cost of underwater sensor nodes as well as implementation complexity, increasing the lifetime of UASNs is an important issue. Although relay nodes have an important role in reducing the transmission distance and energy consumption. But the efficient RNP (Relay Node Placement) to avoid the critical sensor nodes' elimination is the main problem, i.e., to preserve the connected network. For this aim this paper presents an innovative solution called an Efficient Relay node Setting (ERS) algorithm, which involves formulating the Relay Node Placement (RNP) as a non-convex optimization problem. Actually, due to the Difference Convex (DC) constraints the proposed RNP problem is a non-convex problem and finding an optimal solution is complicated. However, a novel transformation can be applied to DC constraints which converts the problem into its convex programming equivalent. Application of the convex programming offers the advantage of readily computing a global optimal solution. Simulation results confirm the superiority of the proposed scheme over the competing RA method in terms of network lifetime and efficiency. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - Node to Node Watermarking in Wireless Sensor Networks for Authentication of Self Nodes
  Hassan Farsi Seyed Morteza Nourian
  10.7508/jist.2014.02.008
  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
  • Abstract Page
  • Full-Text
  
  4 - Node Classification in Social Network by Distributed Learning Automata
  Ahmad Rahnama Zadeh meybodi meybodi Masoud Taheri Kadkhoda
  10.7508/jist.2017.18.005
  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
  • Abstract Page
  • Full-Text
  
  5 - A New Node Density Based k-edge Connected Topology Control Method: A Desirable QoS Tolerance Approach
  Mohsen Heydarian
  10.7508/jist.2016.04.006
  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
  • Abstract Page
  • Full-Text
  
  6 - Lifetime Improvement Using Cluster Head Selection and Base Station Localization in Wireless Sensor Networks
  maryam najimi Sajjad  Nankhoshki
  10.7508/jist.2018.02.006
  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
  • Abstract Page
  • Full-Text
  
  7 - A Novel User-Centric Method for Graph Summarization Based on Syntactical and Semantical Attributes
  Nosratali  Ashrafi Payaman Mohammadreza Kangavari
  10.7508/jist.2018.02.002
  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
• Open Access Article
  • Abstract Page
  • Full-Text
  
  8 - Use of conditional generative adversarial network to produce synthetic data with the aim of improving the classification of users who publish fake news
  arefeh esmaili Saeed Farzi
  For many years, fake news and messages have been spread in human societies, and today, with the spread of social networks among the people, the possibility of spreading false information has increased more than before. Therefore, detecting fake news and messages has bec More

  For many years, fake news and messages have been spread in human societies, and today, with the spread of social networks among the people, the possibility of spreading false information has increased more than before. Therefore, detecting fake news and messages has become a prominent issue in the research community. It is also important to detect the users who generate this false information and publish it on the network. This paper detects users who publish incorrect information on the Twitter social network in Persian. In this regard, a system has been established based on combining context-user and context-network features with the help of a conditional generative adversarial network (CGAN) for balancing the data set. The system also detects users who publish fake news by modeling the twitter social network into a graph of user interactions and embedding a node to feature vector by Node2vec. Also, by conducting several tests, the proposed system has improved evaluation metrics up to 11%, 13%, 12%, and 12% in precision, recall, F-measure and accuracy respectively, compared to its competitors and has been able to create about 99% precision, in detecting users who publish fake news. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  9 - A New Voice Packing Method to Regenerate Lost Packets
  Y. darmani
  This article introduces a new voice packing scheme to transfer voice samples over the Internet. This method aims to reduce the voice quality degradation caused by lost packets as far as possible. Regenerating lost voice packets in active nodes in the network, introduces More

  This article introduces a new voice packing scheme to transfer voice samples over the Internet. This method aims to reduce the voice quality degradation caused by lost packets as far as possible. Regenerating lost voice packets in active nodes in the network, introduces more received voice quality at the receiver side compared with the other methods. This scheme is simulated using an unreliable network with an active node, and it shows more voice quality than the other schemes even if the network loses 50 percent of packets. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  10 - Simplify Programming of TinyOS Applications for Wireless Sensor Networks
  M. Khezri M.  Sarram F. Adibnia
  Sensor node operating system provides a limited number of common services for developers to construct applications for wireless sensor networks. The sensor network community selected TinyOS as the de facto standard with most existing applications, libraries and device d More

  Sensor node operating system provides a limited number of common services for developers to construct applications for wireless sensor networks. The sensor network community selected TinyOS as the de facto standard with most existing applications, libraries and device drivers available for TinyOS. The programming model of TinyOS is event-based and is not easy to use. In this paper, we present a new task scheduler for TinyOS that includes a new computation concept, named Job. Jobs are a collaborative and non-preemptive way of multitasking. On the next step, we propose a programming model which combines the asynchronous basis of event-driven systems with a more classical programming interface for the developer. As a result, developer that uses such an interface in his application will be provided with the sequential view we wanted. This programming model is suitable for applications that have long running computations and there is a data flow dependency between different tasks. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  11 - A Comprehensive Method to Secure Time Synchronization in Wireless Sensor
  Z. Ahmadi  
  One of the important requirements of sensor networks is synchronization of the nodes. The importance of time in sensor networks causes the adversary tries to disturb time synchronization by altering and faking messages, delaying or replying them, compromising the nodes More

  One of the important requirements of sensor networks is synchronization of the nodes. The importance of time in sensor networks causes the adversary tries to disturb time synchronization by altering and faking messages, delaying or replying them, compromising the nodes and sending false messages via them. Up to now, there is no method that is able to provide both synchronization and security needs of sensor networks simultaneously. In this paper, we suggest a method that is capable to provide precise synchronization, along with low communication and computational overhead, low convergence time and high security against internal and external attacks. Simulation and analytic results show the preference of our method compared to other available methods. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  12 - Load Balancing in Fog Nodes using Reinforcement Learning Algorithm
  niloofar tahmasebi pouya Mehdi-Agha  Sarram
  Fog computing is an emerging research field for providing cloud computing services to the edges of the network. Fog nodes process data stream and user requests in real-time. In order to optimize resource efficiency and response time, increase speed and performance, task More

  Fog computing is an emerging research field for providing cloud computing services to the edges of the network. Fog nodes process data stream and user requests in real-time. In order to optimize resource efficiency and response time, increase speed and performance, tasks must be evenly distributed among the fog nodes. Therefore, in this paper, a new method is proposed to improve the load balancing in the fog computing environment. In the proposed algorithm, when a task is sent to the fog node via mobile devices, the fog node using reinforcement learning decides to process that task itself, or assign it to one of the neighbor fog nodes or cloud for processing. The evaluation shows that the proposed algorithm, with proper distribution of tasks between nodes, has less delay to tasks processing than other compared methods. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  13 - palaeoechology and taphonomy of Albian-Cenomanian Echinoids of Kazhdumi Formation in Firouzabad section, Zagros Basin
  Babak Sedghi Ali Bahrami Yazdi Yazdi
  Kazhdumi Formation deposits in Firouzabad section were investigated regarding the postmortem and burial events of echinoderms, from about 150 echinoderm fossils which include 10 genera and 13 species of Coenholectypus neocomiensis, Phymosoma binexilis, Dorocidaris taouz More

  Kazhdumi Formation deposits in Firouzabad section were investigated regarding the postmortem and burial events of echinoderms, from about 150 echinoderm fossils which include 10 genera and 13 species of Coenholectypus neocomiensis, Phymosoma binexilis, Dorocidaris taouzensis, Cottaldia aff. Benettiae, Leptosalenia sergipensis, Phymosoma baylei, Micropedina olisiponensis, Tetragramma deshayesi, Macraster douvillei, Mecaster batnensis, Macraster obtritus, Pliotoxaster comanchei, Macraster sp., Hemiaster sp. most part of them suffer from disarticulation and fragmentation, radial cracks and shell deformation (test outline distortion and radial cracking) and volume change and biological erosion (bioerosion) and perforation by living worms (microboring). Of course, after volume changes, fractures or taphonomic compression, the existing solutions (hydrocarbon and solutions rich in iron, manganese and sometimes silica) hydroxides have been replaced in the cracks. The test of these echinoderms has been used by symbiotic epifauna such as Osterids and Gryphaes as food and attachment points and shelter after their death and burial. It seems that the volume change, crushing, solution injection and fauna bending are influenced by the tectonic pressure of the salt domes of the region and the soft lithology (high plasticity) of the Kazhdami formation between the Darian and Sarvak formations. Manuscript profile