CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: selfish nodes</title> <meta name="description" content="Search results for: selfish nodes"> <meta name="keywords" content="selfish nodes"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="selfish nodes" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="selfish nodes"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 678</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: selfish nodes</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">678</span> Misleading Node Detection and Response Mechanism in Mobile Ad-Hoc Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Earleen%20Jane%20Fuentes">Earleen Jane Fuentes</a>, <a href="https://publications.waset.org/abstracts/search?q=Regeene%20Melarese%20Lim"> Regeene Melarese Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Franklin%20Benjamin%20Tapia"> Franklin Benjamin Tapia</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexis%20Pantola"> Alexis Pantola</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile Ad-hoc Network (MANET) is an infrastructure-less network of mobile devices, also known as nodes. These nodes heavily rely on each other’s resources such as memory, computing power, and energy. Thus, some nodes may become selective in forwarding packets so as to conserve their resources. These nodes are called misleading nodes. Several reputation-based techniques (e.g. CORE, CONFIDANT, LARS, SORI, OCEAN) and acknowledgment-based techniques (e.g. TWOACK, S-TWOACK, EAACK) have been proposed to detect such nodes. These techniques do not appropriately punish misleading nodes. Hence, this paper addresses the limitations of these techniques using a system called MINDRA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=acknowledgment-based%20techniques" title="acknowledgment-based techniques">acknowledgment-based techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20ad-hoc%20network" title=" mobile ad-hoc network"> mobile ad-hoc network</a>, <a href="https://publications.waset.org/abstracts/search?q=selfish%20nodes" title=" selfish nodes"> selfish nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=reputation-based%20techniques" title=" reputation-based techniques"> reputation-based techniques</a> </p> <a href="https://publications.waset.org/abstracts/49862/misleading-node-detection-and-response-mechanism-in-mobile-ad-hoc-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49862.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">386</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">677</span> The Modulation of Self-interest Instruction on the Fair-Proposing Behavior in Ultimatum Game</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20S.%20Yen">N. S. Yen</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20H.%20Yang"> T. H. Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20H.%20Huang"> W. H. Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20F.%20Fang"> Y. F. Fang</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20W.%20Cho"> H. W. Cho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ultimatum game is an experimental paradigm to study human decision making. There are two players, a proposer and a responder, to split a fixed amount of money. According to the traditional economic theory on ultimatum game, proposer should propose the selfish offers to responder as much as possible to maximize proposer’s own outcomes. However, most evidences had showed that people chose more fair offers, hence two hypotheses – fairness favoring and strategic concern were proposed. In current study, we induced the motivation in participants to be either selfish or altruistic, and manipulated the task variables, the stake sizes (NT$100, 1000, 10000) and the share sizes (the 40%, 30%, 20%, 10% of the sum as selfish offers, and the 60%, 70%, 80%, 90% of the sum as altruistic offers), to examine the two hypotheses. The results showed that most proposers chose more fair offers with longer reaction times (RTs) no matter in choosing between the fair and selfish offers, or between the fair and altruistic offers. However, the proposers received explicit self-interest instruction chose more selfish offers accompanied with longer RTs in choosing between the fair and selfish offers. Therefore, the results supported the strategic concern hypothesis that previous proposers choosing the fair offers might be resulted from the fear of rejection by responders. Proposers would become more self-interest if the fear of being rejected is eliminated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ultimatum%20game" title="ultimatum game">ultimatum game</a>, <a href="https://publications.waset.org/abstracts/search?q=proposer" title=" proposer"> proposer</a>, <a href="https://publications.waset.org/abstracts/search?q=self-interest" title=" self-interest"> self-interest</a>, <a href="https://publications.waset.org/abstracts/search?q=fear%20of%20rejection" title=" fear of rejection"> fear of rejection</a> </p> <a href="https://publications.waset.org/abstracts/65525/the-modulation-of-self-interest-instruction-on-the-fair-proposing-behavior-in-ultimatum-game" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65525.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">376</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">676</span> Improving Utilization of Sugarcane by Replacing Ordinary Propagation Material with Small Chips of Sugarcane Planted in Paper Pots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20Garcia">C. Garcia</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Andreasen"> C. Andreasen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sugarcane is an important resource for bioenergy. Fields are usually established by using 15-20 cm pieces of sugarcane stalks as propagation material. An alternative method is to use small chips with nodes from sugarcane stalks. Plants from nodes are often established in plastic pots, but plastic pots could be replaced with biodegradable paper pots. This would be a more sustainable solution, reducing labor costs and avoiding pollution with plastic. We compared the establishment of plants from nodes taken from three different part of the sugarcane plant. The nodes were planted in plastic and paper pots. There was no significant difference between plants established in the two pot types. Nodes from different part of the stalk had different sprouting capacity. Nodes from the top parts sprouted significantly better than nodes taken from the middle or nodes taken closed to the ground in two experiments. Nodes with a length of 3 cm performed better than nodes with a length of 2 cm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nodes" title="nodes">nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=paper%20pots" title=" paper pots"> paper pots</a>, <a href="https://publications.waset.org/abstracts/search?q=propagation%20material" title=" propagation material"> propagation material</a>, <a href="https://publications.waset.org/abstracts/search?q=sugarcane" title=" sugarcane"> sugarcane</a> </p> <a href="https://publications.waset.org/abstracts/60780/improving-utilization-of-sugarcane-by-replacing-ordinary-propagation-material-with-small-chips-of-sugarcane-planted-in-paper-pots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60780.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">212</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">675</span> Data Clustering in Wireless Sensor Network Implemented on Self-Organization Feature Map (SOFM) Neural Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Krishan%20Kumar">Krishan Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohit%20Mittal"> Mohit Mittal</a>, <a href="https://publications.waset.org/abstracts/search?q=Pramod%20Kumar"> Pramod Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless sensor network is one of the most promising communication networks for monitoring remote environmental areas. In this network, all the sensor nodes are communicated with each other via radio signals. The sensor nodes have capability of sensing, data storage and processing. The sensor nodes collect the information through neighboring nodes to particular node. The data collection and processing is done by data aggregation techniques. For the data aggregation in sensor network, clustering technique is implemented in the sensor network by implementing self-organizing feature map (SOFM) neural network. Some of the sensor nodes are selected as cluster head nodes. The information aggregated to cluster head nodes from non-cluster head nodes and then this information is transferred to base station (or sink nodes). The aim of this paper is to manage the huge amount of data with the help of SOM neural network. Clustered data is selected to transfer to base station instead of whole information aggregated at cluster head nodes. This reduces the battery consumption over the huge data management. The network lifetime is enhanced at a greater extent. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20network" title="artificial neural network">artificial neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20clustering" title=" data clustering"> data clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=self%20organization%20feature%20map" title=" self organization feature map"> self organization feature map</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a> </p> <a href="https://publications.waset.org/abstracts/36662/data-clustering-in-wireless-sensor-network-implemented-on-self-organization-feature-map-sofm-neural-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36662.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">518</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">674</span> Scheduling Nodes Activity and Data Communication for Target Tracking in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=AmirHossein%20Mohajerzadeh">AmirHossein Mohajerzadeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Alishahi"> Mohammad Alishahi</a>, <a href="https://publications.waset.org/abstracts/search?q=Saeed%20Aslishahi"> Saeed Aslishahi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Zabihi"> Mohsen Zabihi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider sensor nodes with the capability of measuring the bearings (relative angle to the target). We use geometric methods to select a set of observer nodes which are responsible for collecting data from the target. Considering the characteristics of target tracking applications, it is clear that significant numbers of sensor nodes are usually inactive. Therefore, in order to minimize the total network energy consumption, a set of sensor nodes, called sentinel, is periodically selected for monitoring, controlling the environment and transmitting data through the network. The other nodes are inactive. Furthermore, the proposed algorithm provides a joint scheduling and routing algorithm to transmit data between network nodes and the fusion center (FC) in which not only provides an efficient way to estimate the target position but also provides an efficient target tracking. Performance evaluation confirms the superiority of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coverage" title="coverage">coverage</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=target%20tracking" title=" target tracking"> target tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/46939/scheduling-nodes-activity-and-data-communication-for-target-tracking-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46939.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">380</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">673</span> Node Optimization in Wireless Sensor Network: An Energy Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20B.%20Kirankumar">Y. B. Kirankumar</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20D.%20Mallapur"> J. D. Mallapur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Sensor Network (WSN) is an emerging technology, which has great invention for various low cost applications both for mass public as well as for defence. The wireless sensor communication technology allows random participation of sensor nodes with particular applications to take part in the network, which results in most of the uncovered simulation area, where fewer nodes are located at far distances. The drawback of such network would be that the additional energy is spent by the nodes located in a pattern of dense location, using more number of nodes for a smaller distance of communication adversely in a region with less number of nodes and additional energy is again spent by the source node in order to transmit a packet to neighbours, thereby transmitting the packet to reach the destination. The proposed work is intended to develop Energy Efficient Node Placement Algorithm (EENPA) in order to place the sensor node efficiently in simulated area, where all the nodes are equally located on a radial path to cover maximum area at equidistance. The total energy consumed by each node compared to random placement of nodes is less by having equal burden on fewer nodes of far location, having distributed the nodes in whole of the simulation area. Calculating the network lifetime also proves to be efficient as compared to random placement of nodes, hence increasing the network lifetime, too. Simulation is been carried out in a qualnet simulator, results are obtained on par with random placement of nodes with EENP algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy" title="energy">energy</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20approach" title=" energy approach"> energy approach</a> </p> <a href="https://publications.waset.org/abstracts/6185/node-optimization-in-wireless-sensor-network-an-energy-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6185.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">313</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">672</span> Research on Dynamic Practical Byzantine Fault Tolerance Consensus Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cao%20Xiaopeng">Cao Xiaopeng</a>, <a href="https://publications.waset.org/abstracts/search?q=Shi%20Linkai"> Shi Linkai </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The practical Byzantine fault-tolerant algorithm does not add nodes dynamically. It is limited in practical application. In order to add nodes dynamically, Dynamic Practical Byzantine Fault Tolerance Algorithm (DPBFT) was proposed. Firstly, a new node sends request information to other nodes in the network. The nodes in the network decide their identities and requests. Then the nodes in the network reverse connect to the new node and send block information of the current network. The new node updates information. Finally, the new node participates in the next round of consensus, changes the view and selects the master node. This paper abstracts the decision of nodes into the undirected connected graph. The final consistency of the graph is used to prove that the proposed algorithm can adapt to the network dynamically. Compared with the PBFT algorithm, DPBFT has better fault tolerance and lower network bandwidth. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=practical%20byzantine" title="practical byzantine">practical byzantine</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20algorithm" title=" consensus algorithm"> consensus algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=consistency%20analysis" title=" consistency analysis"> consistency analysis</a> </p> <a href="https://publications.waset.org/abstracts/128883/research-on-dynamic-practical-byzantine-fault-tolerance-consensus-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128883.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">130</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">671</span> A New Heuristic Algorithm for Maximization Total Demands of Nodes and Number of Covered Nodes Simultaneously</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ehsan%20Saghehei">Ehsan Saghehei</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Eghbali"> Mahdi Eghbali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The maximal covering location problem (MCLP) was originally developed to determine a set of facility locations which would maximize the total customers' demand serviced by the facilities within a predetermined critical service criterion. However, on some problems that differences between the demand nodes are covered or the number of nodes each node is large, the method of solving MCLP may ignore these differences. In this paper, Heuristic solution based on the ranking of demands in each node and the number of nodes covered by each node according to a predetermined critical value is proposed. The output of this method is to maximize total demands of nodes and number of covered nodes, simultaneously. Furthermore, by providing an example, the solution algorithm is described and its results are compared with Greedy and Lagrange algorithms. Also, the results of the algorithm to solve the larger problem sizes that compared with other methods are provided. A summary and future works conclude the paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heuristic%20solution" title="heuristic solution">heuristic solution</a>, <a href="https://publications.waset.org/abstracts/search?q=maximal%20covering%20location%20problem" title=" maximal covering location problem"> maximal covering location problem</a>, <a href="https://publications.waset.org/abstracts/search?q=ranking" title=" ranking"> ranking</a>, <a href="https://publications.waset.org/abstracts/search?q=set%20covering" title=" set covering"> set covering</a> </p> <a href="https://publications.waset.org/abstracts/29314/a-new-heuristic-algorithm-for-maximization-total-demands-of-nodes-and-number-of-covered-nodes-simultaneously" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29314.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">573</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">670</span> A Wireless Sensor Network Protocol for a Car Parking Space Monitoring System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jung-Ho%20Moon">Jung-Ho Moon</a>, <a href="https://publications.waset.org/abstracts/search?q=Myung-Gon%20Yoon"> Myung-Gon Yoon</a>, <a href="https://publications.waset.org/abstracts/search?q=Tae%20Kwon%20Ha"> Tae Kwon Ha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a wireless sensor network protocol for a car parking monitoring system. A wireless sensor network for the purpose is composed of multiple sensor nodes, a sink node, a gateway, and a server. Each of the sensor nodes is equipped with a 3-axis AMR sensor and deployed in the center of a parking space. The sensor node reads its sensor values periodically and transmits the data to the sink node if the current and immediate past sensor values show a difference exceeding a threshold value. The operations of the sink and sensor nodes are described in detail along with flow diagrams. The protocol allows a low-duty cycle operation of the sensor nodes and a flexible adjustment of the threshold value used by the sensor nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=car%20parking%20monitoring" title="car parking monitoring">car parking monitoring</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%20node" title=" sensor node"> sensor node</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20protocol" title=" network protocol"> network protocol</a> </p> <a href="https://publications.waset.org/abstracts/11153/a-wireless-sensor-network-protocol-for-a-car-parking-space-monitoring-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11153.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">538</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">669</span> Orphan Node Inclusion Protocol for Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sandeep%20Singh%20Waraich">Sandeep Singh Waraich</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless sensor network (WSN ) consists of a large number of sensor nodes. The disparity in their energy consumption usually lead to the loss of equilibrium in wireless sensor network which may further results in an energy hole problem in wireless network. In this paper, we have considered the inclusion of orphan nodes which usually remain unutilized as intermediate nodes in multi-hop routing. The Orphan Node Inclusion (ONI) Protocol lets the cluster member to bring the orphan nodes into their clusters, thereby saving important resources and increasing network lifetime in critical applications of WSN. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title="wireless sensor network">wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=orphan%20node" title=" orphan node"> orphan node</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=ONI%20protocol" title=" ONI protocol"> ONI protocol</a> </p> <a href="https://publications.waset.org/abstracts/52358/orphan-node-inclusion-protocol-for-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52358.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">421</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">668</span> O-LEACH: The Problem of Orphan Nodes in the LEACH of Routing Protocol for Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wassim%20Jerbi">Wassim Jerbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Abderrahmen%20Guermazi"> Abderrahmen Guermazi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hafedh%20Trabelsi"> Hafedh Trabelsi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The optimum use of coverage in wireless sensor networks (WSNs) is very important. LEACH protocol called Low Energy Adaptive Clustering Hierarchy, presents a hierarchical clustering algorithm for wireless sensor networks. LEACH is a protocol that allows the formation of distributed cluster. In each cluster, LEACH randomly selects some sensor nodes called cluster heads (CHs). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node joins a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus, several sensor nodes cannot reach any CH. to solve this problem. We created an O-LEACH Orphan nodes protocol, its role is to reduce the sensor nodes which do not belong the cluster. The cluster member called Gateway receives messages from neighboring orphan nodes. The gateway informs CH having the neighboring nodes that not belong to any group. However, Gateway called (CH') attaches the orphaned nodes to the cluster and then collected the data. O-Leach enables the formation of a new method of cluster, leads to a long life and minimal energy consumption. Orphan nodes possess enough energy and seeks to be covered by the network. The principal novel contribution of the proposed work is O-LEACH protocol which provides coverage of the whole network with a minimum number of orphaned nodes and has a very high connectivity rates.As a result, the WSN application receives data from the entire network including orphan nodes. The proper functioning of the Application requires, therefore, management of intelligent resources present within each the network sensor. The simulation results show that O-LEACH performs better than LEACH in terms of coverage, connectivity rate, energy and scalability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WSNs%3B%20routing%3B%20LEACH%3B%20O-LEACH%3B%20Orphan%20nodes%3B%20sub-cluster%3B%20gateway%3B%20CH%E2%80%99" title="WSNs; routing; LEACH; O-LEACH; Orphan nodes; sub-cluster; gateway; CH’">WSNs; routing; LEACH; O-LEACH; Orphan nodes; sub-cluster; gateway; CH’</a> </p> <a href="https://publications.waset.org/abstracts/43405/o-leach-the-problem-of-orphan-nodes-in-the-leach-of-routing-protocol-for-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43405.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">372</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">667</span> Power-Aware Adaptive Coverage Control with Consensus Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mert%20Turanli">Mert Turanli</a>, <a href="https://publications.waset.org/abstracts/search?q=Hakan%20Temeltas"> Hakan Temeltas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new approach to coverage control problem by using adaptive coordination and power aware control laws. Nonholonomic mobile nodes position themselves suboptimally according to a time-varying density function using Centroidal Voronoi Tesellations. The Lyapunov stability analysis of the adaptive and decentralized approach is given. A linear consensus protocol is used to establish synchronization among the mobile nodes. Also, repulsive forces prevent nodes from collision. Simulation results show that by using power aware control laws, energy consumption of the nodes can be reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=power%20aware" title="power aware">power aware</a>, <a href="https://publications.waset.org/abstracts/search?q=coverage%20control" title=" coverage control"> coverage control</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive" title=" adaptive"> adaptive</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus" title=" consensus"> consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=nonholonomic" title=" nonholonomic"> nonholonomic</a>, <a href="https://publications.waset.org/abstracts/search?q=coordination" title=" coordination"> coordination</a> </p> <a href="https://publications.waset.org/abstracts/34760/power-aware-adaptive-coverage-control-with-consensus-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34760.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">354</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">666</span> Avoiding Packet Drop for Improved through Put in the Multi-Hop Wireless N/W</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manish%20Kumar%20Rajak">Manish Kumar Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjay%20Gupta"> Sanjay Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile ad hoc networks (MANETs) are infrastructure less and intercommunicate using single-hop and multi-hop paths. Network based congestion avoidance which involves managing the queues in the network devices is an integral part of any network. QoS: A set of service requirements that are met by the network while transferring a packet stream from a source to a destination. Especially in MANETs, packet loss results in increased overheads. This paper presents a new algorithm to avoid congestion using one or more queue on nodes and corresponding flow rate decided in advance for each node. When any node attains an initial value of queue then it sends this status to its downstream nodes which in turn uses the pre-decided flow rate of packet transfer to its upstream nodes. The flow rate on each node is adjusted according to the status received from its upstream nodes. This proposed algorithm uses the existing infrastructure to inform to other nodes about its current queue status. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mesh%20networks" title="mesh networks">mesh networks</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=packet%20count" title=" packet count"> packet count</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold" title=" threshold"> threshold</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput"> throughput</a> </p> <a href="https://publications.waset.org/abstracts/23702/avoiding-packet-drop-for-improved-through-put-in-the-multi-hop-wireless-nw" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23702.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">476</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">665</span> Care: A Cluster Based Approach for Reliable and Efficient Routing Protocol in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Prasanth">K. Prasanth</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Hafeezullah%20Khan"> S. Hafeezullah Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Haribalakrishnan"> B. Haribalakrishnan</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Arun"> D. Arun</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Jayapriya"> S. Jayapriya</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Dhivya"> S. Dhivya</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Vijayarangan"> N. Vijayarangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main goal of our approach is to find the optimum positions for the sensor nodes, reinforcing the communications in points where certain lack of connectivity is found. Routing is the major problem in sensor network’s data transfer between nodes. We are going to provide an efficient routing technique to make data signal transfer to reach the base station soon without any interruption. Clustering and routing are the two important key factors to be considered in case of WSN. To carry out the communication from the nodes to their cluster head, we propose a parameterizable protocol so that the developer can indicate if the routing has to be sensitive to either the link quality of the nodes or the their battery levels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clusters" title="clusters">clusters</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20phases" title=" three phases"> three phases</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%20networks" title=" sensor networks"> sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/1733/care-a-cluster-based-approach-for-reliable-and-efficient-routing-protocol-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1733.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">506</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">664</span> Power Aware Modified I-LEACH Protocol Using Fuzzy IF Then Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gagandeep%20Singh">Gagandeep Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Navdeep%20Singh"> Navdeep Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to limited battery of sensor nodes, so energy efficiency found to be main constraint in WSN. Therefore the main focus of the present work is to find the ways to minimize the energy consumption problem and will results; enhancement in the network stability period and life time. Many researchers have proposed different kind of the protocols to enhance the network lifetime further. This paper has evaluated the issues which have been neglected in the field of the WSNs. WSNs are composed of multiple unattended ultra-small, limited-power sensor nodes. Sensor nodes are deployed randomly in the area of interest. Sensor nodes have limited processing, wireless communication and power resource capabilities Sensor nodes send sensed data to sink or Base Station (BS). I-LEACH gives adaptive clustering mechanism which very efficiently deals with energy conservations. This paper ends up with the shortcomings of various adaptive clustering based WSNs protocols. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WSN" title="WSN">WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=I-Leach" title=" I-Leach"> I-Leach</a>, <a href="https://publications.waset.org/abstracts/search?q=MATLAB" title=" MATLAB"> MATLAB</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor" title=" sensor "> sensor </a> </p> <a href="https://publications.waset.org/abstracts/10829/power-aware-modified-i-leach-protocol-using-fuzzy-if-then-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10829.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">275</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">663</span> Maximizing Coverage with Mobile Crime Cameras in a Stochastic Spatiotemporal Bipartite Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=%28Ted%29%20Edward%20Holmberg">(Ted) Edward Holmberg</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Abdelguerfi"> Mahdi Abdelguerfi</a>, <a href="https://publications.waset.org/abstracts/search?q=Elias%20Ioup"> Elias Ioup</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research details a coverage measure for evaluating the effectiveness of observer node placements in a spatial bipartite network. This coverage measure can be used to optimize the configuration of stationary or mobile spatially oriented observer nodes, or a hybrid of the two, over time in order to fully utilize their capabilities. To demonstrate the practical application of this approach, we construct a SpatioTemporal Bipartite Network (STBN) using real-time crime center (RTCC) camera nodes and NOPD calls for service (CFS) event nodes from New Orleans, La (NOLA). We use the coverage measure to identify optimal placements for moving mobile RTCC camera vans to improve coverage of vulnerable areas based on temporal patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coverage%20measure" title="coverage measure">coverage measure</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20node%20dynamics" title=" mobile node dynamics"> mobile node dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo%20simulation" title=" Monte Carlo simulation"> Monte Carlo simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=observer%20nodes" title=" observer nodes"> observer nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=observable%20nodes" title=" observable nodes"> observable nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=spatiotemporal%20bipartite%20knowledge%20graph" title=" spatiotemporal bipartite knowledge graph"> spatiotemporal bipartite knowledge graph</a>, <a href="https://publications.waset.org/abstracts/search?q=temporal%20spatial%20analysis" title=" temporal spatial analysis"> temporal spatial analysis</a> </p> <a href="https://publications.waset.org/abstracts/161229/maximizing-coverage-with-mobile-crime-cameras-in-a-stochastic-spatiotemporal-bipartite-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161229.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">116</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">662</span> Agent Based Location Management Protocol for Mobile Adhoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mallikarjun%20B.%20Channappagoudar">Mallikarjun B. Channappagoudar</a>, <a href="https://publications.waset.org/abstracts/search?q=Pallapa%20Venkataram"> Pallapa Venkataram</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The dynamic nature of Mobile adhoc network (MANET) due to mobility and disconnection of mobile nodes, leads to various problems in predicting the movement of nodes and their location information updation, for efficient interaction among the application specific nodes. Location management is one of the main challenges to be considered for an efficient service provision to the applications of a MANET. In this paper, we propose a location management protocol, for locating the nodes of a MANET and to maintain uninterrupted high-quality service for distributed applications by intelligently anticipating the change of location of its nodes. The protocol predicts the node movement and application resource scarcity, does the replacement with the chosen nodes nearby which have less mobility and rich in resources, with the help of both static and mobile agents, and maintains the application continuity by providing required network resources. The protocol has been simulated using Java Agent Development Environment (JADE) Framework for agent generation, migration and communication. It consumes much less time (response time), gives better location accuracy, utilize less network resources, and reduce location management overhead. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20agent" title="mobile agent">mobile agent</a>, <a href="https://publications.waset.org/abstracts/search?q=location%20management" title=" location management"> location management</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20applications" title=" distributed applications"> distributed applications</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20adhoc%20network" title=" mobile adhoc network"> mobile adhoc network</a> </p> <a href="https://publications.waset.org/abstracts/49320/agent-based-location-management-protocol-for-mobile-adhoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49320.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">395</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">661</span> Proposing an Algorithm to Cluster Ad Hoc Networks, Modulating Two Levels of Learning Automaton and Nodes Additive Weighting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Rostami">Mohammad Rostami</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Reza%20Forghani"> Mohammad Reza Forghani</a>, <a href="https://publications.waset.org/abstracts/search?q=Elahe%20Neshat"> Elahe Neshat</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatemeh%20Yaghoobi"> Fatemeh Yaghoobi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An Ad Hoc network consists of wireless mobile equipment which connects to each other without any infrastructure, using connection equipment. The best way to form a hierarchical structure is clustering. Various methods of clustering can form more stable clusters according to nodes' mobility. In this research we propose an algorithm, which allocates some weight to nodes based on factors, i.e. link stability and power reduction rate. According to the allocated weight in the previous phase, the cellular learning automaton picks out in the second phase nodes which are candidates for being cluster head. In the third phase, learning automaton selects cluster head nodes, member nodes and forms the cluster. Thus, this automaton does the learning from the setting and can form optimized clusters in terms of power consumption and link stability. To simulate the proposed algorithm we have used omnet++4.2.2. Simulation results indicate that newly formed clusters have a longer lifetime than previous algorithms and decrease strongly network overload by reducing update rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20Ad%20Hoc%20networks" title="mobile Ad Hoc networks">mobile Ad Hoc networks</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20automaton" title=" learning automaton"> learning automaton</a>, <a href="https://publications.waset.org/abstracts/search?q=cellular%20automaton" title=" cellular automaton"> cellular automaton</a>, <a href="https://publications.waset.org/abstracts/search?q=battery%20power" title=" battery power"> battery power</a> </p> <a href="https://publications.waset.org/abstracts/46359/proposing-an-algorithm-to-cluster-ad-hoc-networks-modulating-two-levels-of-learning-automaton-and-nodes-additive-weighting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46359.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">660</span> Development of Algorithms for the Study of the Image in Digital Form for Satellite Applications: Extraction of a Road Network and Its Nodes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zineb%20Nougrara">Zineb Nougrara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a novel methodology for extracting a road network and its nodes from satellite images of Algeria country. This developed technique is a progress of our previous research works. It is founded on the information theory and the mathematical morphology; the information theory and the mathematical morphology are combined together to extract and link the road segments to form a road network and its nodes. We, therefore, have to define objects as sets of pixels and to study the shape of these objects and the relations that exist between them. In this approach, geometric and radiometric features of roads are integrated by a cost function and a set of selected points of a crossing road. Its performances were tested on satellite images of Algeria country. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=satellite%20image" title="satellite image">satellite image</a>, <a href="https://publications.waset.org/abstracts/search?q=road%20network" title=" road network"> road network</a>, <a href="https://publications.waset.org/abstracts/search?q=nodes" title=" nodes"> nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20analysis%20and%20processing" title=" image analysis and processing"> image analysis and processing</a> </p> <a href="https://publications.waset.org/abstracts/27882/development-of-algorithms-for-the-study-of-the-image-in-digital-form-for-satellite-applications-extraction-of-a-road-network-and-its-nodes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27882.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">274</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">659</span> An Improved Mesh Deformation Method Based on Radial Basis Function</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xuan%20Zhou">Xuan Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Litian%20Zhang"> Litian Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuixiang%20Li"> Shuixiang Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mesh deformation using radial basis function interpolation method has been demonstrated to produce quality meshes with relatively little computational cost using a concise algorithm. However, it still suffers from the limited deformation ability, especially in large deformation. In this paper, a pre-displacement improvement is proposed to improve the problem that illegal meshes always appear near the moving inner boundaries owing to the large relative displacement of the nodes near inner boundaries. In this improvement, nodes near the inner boundaries are first associated to the near boundary nodes, and a pre-displacement based on the displacements of associated boundary nodes is added to the nodes near boundaries in order to make the displacement closer to the boundary deformation and improve the deformation capability. Several 2D and 3D numerical simulation cases have shown that the pre-displacement improvement for radial basis function (RBF) method significantly improves the mesh quality near inner boundaries and deformation capability, with little computational burden increasement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mesh%20deformation" title="mesh deformation">mesh deformation</a>, <a href="https://publications.waset.org/abstracts/search?q=mesh%20quality" title=" mesh quality"> mesh quality</a>, <a href="https://publications.waset.org/abstracts/search?q=background%20mesh" title=" background mesh"> background mesh</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20basis%20function" title=" radial basis function"> radial basis function</a> </p> <a href="https://publications.waset.org/abstracts/65928/an-improved-mesh-deformation-method-based-on-radial-basis-function" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65928.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">366</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">658</span> Modeling and Stability Analysis of Viral Propagation in Wireless Mesh Networking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Haowei%20Chen">Haowei Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaiqi%20Xiong"> Kaiqi Xiong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to answer how malware will propagate in Wireless Mesh Networks (WMNs) and how communication radius and distributed density of nodes affects the process of spreading. The above analysis is essential for devising network-wide strategies to counter malware. We answer these questions by developing an improved dynamical system that models malware propagation in the area where nodes were uniformly distributed. The proposed model captures both the spatial and temporal dynamics regarding the malware spreading process. Equilibrium and stability are also discussed based on the threshold of the system. If the threshold is less than one, the infected nodes disappear, and if the threshold is greater than one, the infected nodes asymptotically stabilize at the endemic equilibrium. Numerical simulations are investigated about communication radius and distributed density of nodes in WMNs, which allows us to draw various insights that can be used to guide security defense. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bluetooth%20security" title="Bluetooth security">Bluetooth security</a>, <a href="https://publications.waset.org/abstracts/search?q=malware%20propagation" title=" malware propagation"> malware propagation</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20mesh%20networks" title=" wireless mesh networks"> wireless mesh networks</a>, <a href="https://publications.waset.org/abstracts/search?q=stability%20analysis" title=" stability analysis"> stability analysis</a> </p> <a href="https://publications.waset.org/abstracts/146464/modeling-and-stability-analysis-of-viral-propagation-in-wireless-mesh-networking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/146464.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">101</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">657</span> Hybrid Hierarchical Routing Protocol for WSN Lifetime Maximization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Aoudia">H. Aoudia</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Touati"> Y. Touati</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20H.%20Teguig"> E. H. Teguig</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Ali%20Cherif"> A. Ali Cherif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conceiving and developing routing protocols for wireless sensor networks requires considerations on constraints such as network lifetime and energy consumption. In this paper, we propose a hybrid hierarchical routing protocol named HHRP combining both clustering mechanism and multipath optimization taking into account residual energy and RSSI measures. HHRP consists of classifying dynamically nodes into clusters where coordinators nodes with extra privileges are able to manipulate messages, aggregate data and ensure transmission between nodes according to TDMA and CDMA schedules. The reconfiguration of the network is carried out dynamically based on a threshold value which is associated with the number of nodes belonging to the smallest cluster. To show the effectiveness of the proposed approach HHRP, a comparative study with LEACH protocol is illustrated in simulations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=routing%20protocol" title="routing protocol">routing protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a> </p> <a href="https://publications.waset.org/abstracts/14550/hybrid-hierarchical-routing-protocol-for-wsn-lifetime-maximization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14550.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">471</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">656</span> Over the Air Programming Method for Learning Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Sangeeth">K. Sangeeth</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Rekha"> P. Rekha</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Preeja"> P. Preeja</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Divya"> P. Divya</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Arya"> R. Arya</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Maneesha"> R. Maneesha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless sensor networks (WSN) are small or tiny devices that consists of different sensors to sense physical parameters like air pressure, temperature, vibrations, movement etc., process these data and sends it to the central data center to take decisions. The WSN domain, has wide range of applications such as monitoring and detecting natural hazards like landslides, forest fire, avalanche, flood monitoring and also in healthcare applications. With such different applications, it is being taught in undergraduate/post graduate level in many universities under department of computer science. But the cost and infrastructure required to purchase WSN nodes for having the students getting hands on expertise on these devices is expensive. This paper gives overview about the remote triggered lab that consists of more than 100 WSN nodes that helps the students to remotely login from anywhere in the world using the World Wide Web, configure the nodes and learn the WSN concepts in intuitive way. It proposes new way called over the air programming (OTAP) and its internals that program the 100 nodes simultaneously and view the results without the nodes being physical connected to the computer system, thereby allowing for sparse deployment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WSN" title="WSN">WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=over%20the%20air%20programming" title=" over the air programming"> over the air programming</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20lab" title=" virtual lab"> virtual lab</a>, <a href="https://publications.waset.org/abstracts/search?q=AT45DB" title=" AT45DB "> AT45DB </a> </p> <a href="https://publications.waset.org/abstracts/41539/over-the-air-programming-method-for-learning-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41539.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">379</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">655</span> Towards Update a Road Map Solution: Use of Information Obtained by the Extraction of Road Network and Its Nodes from a Satellite Image</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Z.%20Nougrara">Z. Nougrara</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Meunier"> J. Meunier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a new approach for extracting roads, there road network and its nodes from satellite image representing regions in Algeria. Our approach is related to our previous research work. It is founded on the information theory and the mathematical morphology. We therefore have to define objects as sets of pixels and to study the shape of these objects and the relations that exist between them. The main interest of this study is to solve the problem of the automatic mapping from satellite images. This study is thus applied for that the geographical representation of the images is as near as possible to the reality. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nodes" title="nodes">nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=road%20network" title=" road network"> road network</a>, <a href="https://publications.waset.org/abstracts/search?q=satellite%20image" title=" satellite image"> satellite image</a>, <a href="https://publications.waset.org/abstracts/search?q=updating%20a%20road%20map" title=" updating a road map"> updating a road map</a> </p> <a href="https://publications.waset.org/abstracts/25331/towards-update-a-road-map-solution-use-of-information-obtained-by-the-extraction-of-road-network-and-its-nodes-from-a-satellite-image" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25331.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">426</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">654</span> Behavior of Beam-Column Nodes Reinforced Concrete in Earthquake Zones</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaidour%20Mohamed">Zaidour Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=Ghalem%20Ali%20Jr."> Ghalem Ali Jr.</a>, <a href="https://publications.waset.org/abstracts/search?q=Achit%20Henni%20Mohamed"> Achit Henni Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This project is destined to study pole junctions of reinforced concrete beams subjected to seismic loads. A literature review was made to clarify the work done by researchers in the last three decades and especially the results of the last two years that were studied for the determination of the method of calculating the transverse reinforcement in the different nodes of a structure. For implementation efforts in the columns and beams of a building R + 4 in zone 3 were calculated using the finite element method through software. These results are the basis of our work which led to the calculation of the transverse reinforcement of the nodes of the structure in question. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=beam%E2%80%93column%20joints" title="beam–column joints">beam–column joints</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20loading" title=" cyclic loading"> cyclic loading</a>, <a href="https://publications.waset.org/abstracts/search?q=shearing%20force" title=" shearing force"> shearing force</a>, <a href="https://publications.waset.org/abstracts/search?q=damaged%20joint" title=" damaged joint"> damaged joint</a> </p> <a href="https://publications.waset.org/abstracts/16216/behavior-of-beam-column-nodes-reinforced-concrete-in-earthquake-zones" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16216.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">550</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">653</span> Speedup Breadth-First Search by Graph Ordering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiuyi%20Lyu">Qiuyi Lyu</a>, <a href="https://publications.waset.org/abstracts/search?q=Bin%20Gong"> Bin Gong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Breadth-First Search(BFS) is a core graph algorithm that is widely used for graph analysis. As it is frequently used in many graph applications, improve the BFS performance is essential. In this paper, we present a graph ordering method that could reorder the graph nodes to achieve better data locality, thus, improving the BFS performance. Our method is based on an observation that the sibling relationships will dominate the cache access pattern during the BFS traversal. Therefore, we propose a frequency-based model to construct the graph order. First, we optimize the graph order according to the nodes’ visit frequency. Nodes with high visit frequency will be processed in priority. Second, we try to maximize the child nodes overlap layer by layer. As it is proved to be NP-hard, we propose a heuristic method that could greatly reduce the preprocessing overheads. We conduct extensive experiments on 16 real-world datasets. The result shows that our method could achieve comparable performance with the state-of-the-art methods while the graph ordering overheads are only about 1/15. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=breadth-first%20search" title="breadth-first search">breadth-first search</a>, <a href="https://publications.waset.org/abstracts/search?q=BFS" title=" BFS"> BFS</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20ordering" title=" graph ordering"> graph ordering</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20algorithm" title=" graph algorithm"> graph algorithm</a> </p> <a href="https://publications.waset.org/abstracts/136790/speedup-breadth-first-search-by-graph-ordering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136790.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">138</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">652</span> Matlab Method for Exclusive-or Nodes in Fuzzy GERT Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roland%20Lachmayer">Roland Lachmayer</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahtab%20Afsari"> Mahtab Afsari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Research is the cornerstone for advancement of human communities. So that it is one of the indexes for evaluating advancement of countries. Research projects are usually cost and time-consuming and do not end in result in short term. Project scheduling is one of the integral parts of project management. The present article offers a new method by using C# and Matlab software to solve Fuzzy GERT networks for Exclusive-OR kind of nodes to schedule the network. In this article we concentrate on flowcharts that we used in Matlab to show how we apply Matlab to schedule Exclusive-OR nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=research%20projects" title="research projects">research projects</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20GERT" title=" fuzzy GERT"> fuzzy GERT</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20CPM" title=" fuzzy CPM"> fuzzy CPM</a>, <a href="https://publications.waset.org/abstracts/search?q=CPM" title=" CPM"> CPM</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%B1-cuts" title=" α-cuts"> α-cuts</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/16374/matlab-method-for-exclusive-or-nodes-in-fuzzy-gert-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16374.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">399</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">651</span> A Comparative and Critical Analysis of Some Routing Protocols in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ishtiaq%20Wahid">Ishtiaq Wahid</a>, <a href="https://publications.waset.org/abstracts/search?q=Masood%20Ahmad"> Masood Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=Nighat%20Ayub"> Nighat Ayub</a>, <a href="https://publications.waset.org/abstracts/search?q=Sajad%20Ali"> Sajad Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lifetime of a wireless sensor network (WSN) is directly proportional to the energy consumption of its constituent nodes. Routing in wireless sensor network is very challenging due its inherit characteristics. In hierarchal routing the sensor ﬁled is divided into clusters. The cluster-heads are selected from each cluster, which forms a hierarchy of nodes. The cluster-heads are used to transmit the data to the base station while other nodes perform the sensing task. In this way the lifetime of the network is increased. In this paper a comparative study of hierarchal routing protocols are conducted. The simulation is done in NS-2 for validation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WSN" title="WSN">WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=cluster" title=" cluster"> cluster</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%20networks" title=" sensor networks"> sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/41484/a-comparative-and-critical-analysis-of-some-routing-protocols-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41484.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">480</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">650</span> Proposing a Boundary Coverage Algorithm ‎for Underwater Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Mohsen%20Jameii">Seyed Mohsen Jameii</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless underwater sensor networks are a type of sensor networks that are located in underwater environments and linked together by acoustic waves. The application of these kinds of network includes monitoring of pollutants (chemical, biological, and nuclear), oil fields detection, prediction of the likelihood of a tsunami in coastal areas, the use of wireless sensor nodes to monitor the passing submarines, and determination of appropriate locations for anchoring ships. This paper proposes a boundary coverage algorithm for intrusion detection in underwater sensor networks. In the first phase of the proposed algorithm, optimal deployment of nodes is done in the water. In the second phase, after the employment of nodes at the proper depth, clustering is executed to reduce the exchanges of messages between the sensors. In the third phase, the algorithm of "divide and conquer" is used to save energy and increase network efficiency. The simulation results demonstrate the efficiency of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=boundary%20coverage" title="boundary coverage">boundary coverage</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=divide%20and%20%E2%80%8Econquer" title=" divide and ‎conquer"> divide and ‎conquer</a>, <a href="https://publications.waset.org/abstracts/search?q=underwater%20sensor%20nodes" title=" underwater sensor nodes"> underwater sensor nodes</a> </p> <a href="https://publications.waset.org/abstracts/58628/proposing-a-boundary-coverage-algorithm-for-underwater-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58628.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">343</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">649</span> Implementation of an Associative Memory Using a Restricted Hopfield Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tet%20H.%20Yeap">Tet H. Yeap</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An analog restricted Hopfield Network is presented in this paper. It consists of two layers of nodes, visible and hidden nodes, connected by directional weighted paths forming a bipartite graph with no intralayer connection. An energy or Lyapunov function was derived to show that the proposed network will converge to stable states. By introducing hidden nodes, the proposed network can be trained to store patterns and has increased memory capacity. Training to be an associative memory, simulation results show that the associative memory performs better than a classical Hopfield network by being able to perform better memory recall when the input is noisy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=restricted%20Hopfield%20network" title="restricted Hopfield network">restricted Hopfield network</a>, <a href="https://publications.waset.org/abstracts/search?q=Lyapunov%20function" title=" Lyapunov function"> Lyapunov function</a>, <a href="https://publications.waset.org/abstracts/search?q=simultaneous%20perturbation%20stochastic%20approximation" title=" simultaneous perturbation stochastic approximation"> simultaneous perturbation stochastic approximation</a> </p> <a href="https://publications.waset.org/abstracts/122365/implementation-of-an-associative-memory-using-a-restricted-hopfield-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122365.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">134</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=22">22</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=23">23</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=selfish%20nodes&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>