186 research outputs found

    Game theoretic approach in routing protocol for wireless ad hoc networks

    Get PDF
    This paper introduces a game theoretic method, called forwarding dilemma game (FDG), which controls routing overhead in dense multi-hop wireless ad hoc networks. The players of the game are the wireless nodes with set of strategies {Forward, Not forward}. The game is played whenever an arbitrary node in the network receives a flooding packet. In FDG, every player needs to know the number of players of the game. That is why a neighbor discovery protocol (NDP) is introduced. In order for NDP to function, a field is attached to the flooding packets (routing overhead packets). The mixed strategy Nash equilibrium is used as a solution for the FDG. This provides the probability that the flooding packet would be forwarded by the receiver node. FDG with NDP is implemented in AODV protocol in Network Simulator NS-2 to verify its performance with simulations. FDG with NDP improves performance of the AODV compared to the same network with only AODV protocol in moderate and high node densities. FDG can be applied to any routing protocol that uses flooding in the route discovery phase

    Smart handoff technique for internet of vehicles communication using dynamic edge-backup node

    Get PDF
    © 2020 The Authors. Published by MDPI. This is an open access article available under a Creative Commons licence. The published version can be accessed at the following link on the publisher’s website: https://doi.org/10.3390/electronics9030524A vehicular adhoc network (VANET) recently emerged in the the Internet of Vehicles (IoV); it involves the computational processing of moving vehicles. Nowadays, IoV has turned into an interesting field of research as vehicles can be equipped with processors, sensors, and communication devices. IoV gives rise to handoff, which involves changing the connection points during the online communication session. This presents a major challenge for which many standardized solutions are recommended. Although there are various proposed techniques and methods to support seamless handover procedure in IoV, there are still some open research issues, such as unavoidable packet loss rate and latency. On the other hand, the emerged concept of edge mobile computing has gained crucial attention by researchers that could help in reducing computational complexities and decreasing communication delay. Hence, this paper specifically studies the handoff challenges in cluster based handoff using new concept of dynamic edge-backup node. The outcomes are evaluated and contrasted with the network mobility method, our proposed technique, and other cluster-based technologies. The results show that coherence in communication during the handoff method can be upgraded, enhanced, and improved utilizing the proposed technique.Published onlin

    Identifying vital edges in Chinese air route network via memetic algorithm

    Get PDF
    Due to its rapid development in the past decade, air transportation system has attracted considerable research attention from diverse communities. While most of the previous studies focused on airline networks, here we systematically explore the robustness of the Chinese air route network, and identify the vital edges which form the backbone of Chinese air transportation system. Specifically, we employ a memetic algorithm to minimize the network robustness after removing certain edges hence the solution of this model is the set of vital edges. Counterintuitively, our results show that the most vital edges are not necessarily the edges of highest topological importance, for which we provide an extensive explanation from the microscope of view. Our findings also offer new insights to understanding and optimizing other real-world network systems

    Solutions and Recent Challenges Related to Energy in Wireless Body Area Networks with Integrated Technologies: Applications and Perspectives

    Get PDF
    في هذه الورقة، بحثنا في بعض أحدث بروتوكولات التوجيه الموفرة للطاقة لشبكات منطقة الجسم اللاسلكية. شهدت هذه التكنولوجيا تطورات في الآونة الأخيرة حيث يتم حقن أجهزة استشعار لاسلكية في جسم الإنسان لاستشعار وقياس معايير الجسم مثل درجة الحرارة ونبض القلب ومستوى الجلوكوز. تقوم هذه المستشعرات اللاسلكية الدقيقة بجمع معلومات بيانات الجسم وإرسالها عبر شبكة لاسلكية وإلى المحطة الأساسية. يتم فحص قياسات البيانات من قبل الطبيب أو الطبيب ويقترح العلاج المناسب. يتم إجراء الاتصال بالكامل من خلال بروتوكولات التوجيه في بيئة الشبكة. يستهلك بروتوكول التوجيه الطاقة أثناء المساعدة في الاتصال دون توقف في البيئة اللاسلكية. بسبب الحجم الصغير جدًا ، فإن استهلاك الطاقة مهم جدًا. لقد ركزنا على البروتوكولات التي توفر كفاءة استخدام الطاقة وتحسين عمر الشبكة، والإنتاجية، وفقدان الحد الأدنى من المسار. سنناقش بعض أحدث بروتوكولات التوجيه الموفرة للطاقة في هذه الورقة، في وقت لاحق يتم تقديم مقارنة مع جدول مناسب. بالإضافة إلى ذلك، تمت مناقشة التحديات الأخيرة والتطبيق المحتمل ووجهات النظر.          In this paper, we have investigated some of the most recent energy efficient routing protocols for wireless body area networks. This technology has seen advancements in recent times where wireless sensors are injected in the human body to sense and measure body parameters like temperature, heartbeat and glucose level. These tiny wireless sensors gather body data information and send it over a wireless network to the base station. The data measurements are examined by the doctor or   physician and the suitable cure is suggested. The whole communication is done through routing protocols in a network environment. Routing protocol consumes energy while helping non-stop communication in a wireless environment. Because of the very tiny size, energy consumption matters a lot. We have focused on the protocols, which provide energy efficiency and improve network lifetime, through put and minimal path loss. We will be discussing some of the most recent energy efficient routing protocols in this paper; later their comparison with an appropriate table is presented. In addition, recent challenges, possible application and perspectives are discussed.  &nbsp

    Integration of gene expression data with prior knowledge for network analysis and validation

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Reconstruction of protein-protein interaction or metabolic networks based on expression data often involves in silico predictions, while on the other hand, there are unspecific networks of in vivo interactions derived from knowledge bases.</p> <p>We analyze networks designed to come as close as possible to data measured in vivo, both with respect to the set of nodes which were taken to be expressed in experiment as well as with respect to the interactions between them which were taken from manually curated databases</p> <p>Results</p> <p>A signaling network derived from the TRANSPATH database and a metabolic network derived from KEGG LIGAND are each filtered onto expression data from breast cancer (SAGE) considering different levels of restrictiveness in edge and vertex selection.</p> <p>We perform several validation steps, in particular we define pathway over-representation tests based on refined null models to recover functional modules. The prominent role of the spindle checkpoint-related pathways in breast cancer is exhibited. High-ranking key nodes cluster in functional groups retrieved from literature. Results are consistent between several functional and topological analyses and between signaling and metabolic aspects.</p> <p>Conclusions</p> <p>This construction involved as a crucial step the passage to a mammalian protein identifier format as well as to a reaction-based semantics of metabolism. This yielded good connectivity but also led to the need to perform benchmark tests to exclude loss of essential information. Such validation, albeit tedious due to limitations of existing methods, turned out to be informative, and in particular provided biological insights as well as information on the degrees of coherence of the networks despite fragmentation of experimental data.</p> <p>Key node analysis exploited the networks for potentially interesting proteins in view of drug target prediction.</p

    Game theoretic approach in routing protocols for wireless mobile ad hoc networks

    Get PDF
    Mobile Ad hoc Networks (MANETs) are becoming popular as a means of providing communication among a group of people. Because of self-configuring and self-organizing characteristics, MANETs can be deployed quickly. There is no infrastructure defined in the network, therefore all of the participating nodes relay packets for other nodes and perform routing if necessary. Because of the limitations in wireless transmission range, communication links could be multi-hop. Routing protocol is the most important element of MANET. Routing protocols for MANET can broadly be classified as proactive routing protocol and reactive routing protocol. In proactive routing protocols like Destination Sequence Distance Vector (DSDV), mobile nodes periodically exchange routing information among themselves. Hence proactive routing protocols generate high overhead messages in the network. On the other hand, reactive routing protocols like Ad hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) work on-demand. Hence reactive routing protocols generate fewer number of overhead messages in the network compared to proactive routing protocols. But reactive routing protocols use a global search mechanism called flooding during the route discovery process. By flooding mechanism a source node can discover multiple routes to a destination. Flooding generates a large number of overhead packets in the network and is the root cause of scaling problem of reactive routing protocols. Hierarchical Dynamic Source Routing (HDSR) protocol has been proposed in this dissertation to solve that scaling problem. The DSR protocol has been modified and optimized to implement HDSR protocol. HDSR protocol reduces the flooding problem of reactive routing protocols by introducing hierarchy among nodes. Two game theoretic models, Forwarding Dilemma Game (FDG) and Forwarding Game Routing Protocol (FGRP), is proposed to minimize the \u27flooding\u27 effect by restricting nodes that should participate in route discovery process based on their status. Both FDG and FGRP protocols reduce overhead packet and improve network performances in terms of delay packet delivery ratio and throughput. Both protocols were implemented in AODV and the resulting protocol outperformed AODV in our NS-2 simulations. A thorough connectivity analysis was also performed for FDG and FGRP to ensure that these protocols do not introduce disconnectivity. Surprisingly, both FDG and FGRP showed better connectivity compared to AODV in moderate to high node density networks

    Entropic Bonding in Nanoparticle and Colloidal Systems

    Full text link
    Scientists and engineers will create the next generation of materials by precisely controlling their microstructure. One of the most promising and effective methods to control material microstructure is self-assembly, in which the properties of constituent “particles” guide their assembly into the desired structure. Self- assembly mechanisms rely on both inherent interactions between particles and emergent interactions resulting from the collective effects of all particles in the system. These emergent effects are of interest as they provide minimal mechanisms to control self-assembly, and thus can be used in conjunction with other assembly methods to create novel materials. Literature shows that complex phases can be obtained solely from hard, anisotropic particles, which are attracted via an emergent Directional Entropic Force. This thesis shows that this force gives rise to the entropic bond, a mesoscale analog to the chemical bond. In Chapter 3 I investigate the self- assembly of a system from a random tiling into an ordered crystal. Analysis of the emergent directional entropic forces reveal the importance of shape in the final self-assembled system as well as the ability for shape manipulation to control the final self-assembled structure. In Chapter 4, I investigate three-dimensional analogs of two-dimensional systems in Chapter 3, explaining the self-assembly behavior of these systems via understanding of the emergent directional entropic forces. In Chapter 5 I investigate the nature of the entropic bond, investigating two-dimensional systems of hexagonal nanoplatelets. The Entropic bond is quantified, and the ability to manipulate the bonds to produce similar self- assembly behavior to chemically-functionalized nanoparticles is demonstrated. Finally, Chapter 6 investigates the phase transitions of the general class of particle studied in Chapter 5, showing the ability for particle shape to change the type of phase transition present in a system of nanoparticles as well as stabilize phases otherwise not found. As a whole, this work details the nature of the entropic bond and its use in directing the self-assembly of systems of non- interacting anisotropic particles.PHDMaterials Science and EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/144096/1/harperic_1.pd
    corecore