Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper, we determine optimal topology update interval for fault tolerant k-edge connected topology update algorithm Local Tree-based Reliable Topology (LTRT) used in Mobile Ad-hoc Networks (MANETs). Topology update algorithms are periodically run on each participant node of MANET. This period called topology update interval (Δt), is chosen to be uniform. However, neither a high...
Various Ideas on leader election process has evolved and most of them rely on techniques such as extrema finding or centrality finding methods. These methods are very reliable and highly efficient in a static network, but when discussion reaches ad-hoc networks robustness is questioned and current system doesn't answer to this dilemma. So taking in to account this highly dynamic nature of mobile ad-hoc...
Required resource for nodes in an ad hoc network with specific parameters (e.g. node-count and topology) is one of the most important problems for the manufacturer. In this paper, in the first phase, we showed that according to the proposed game model for the node behaviour, the network converge to a steady state and in the second phase, the process of a node in forwarding the received packets is...
Multipoint relaying is a key concept adopted in the optimized link state routing protocol (OLSR). It realizes efficient flooding of topology control (TC) messages. It simultaneously supports generating small topology information which is enough to find the shortest path for any pair of nodes. In this paper, we propose a method to find more efficient multipoint relay (MPR) set, in terms of reducing...
Topology control serves as an important technique in dynamic networks for its capabilities of reducing energy consumption and radio interference. Additionally, the sparse network structure generated by topology control algorithms is beneficial for enhancing network coverage. In this paper, a local two-tier topology control method is developed to address the issues of topology control and coverage...
A mobile ad hoc network (MANET), is a self-configuring network of mobile devices connected by wireless links. In order to achieve stable clusters, the cluster-heads maintaining the cluster should be stable with minimum overhead of cluster re-elections. In this paper we propose a Probability Based Adaptive Invoked Weighted Clustering Algorithm (PAIWCA) which can enhance the stability of the clusters...
Topology control aims to provide more spatial reuse and power conservation while keeping network's connectivity. However just a few number of efforts focused on the issue of topology control with mobility. Some of topology control algorithms (e.g. CEC) try to provide more energy conservation by sleeping the redundant nodes. This paper presents a sleep-based topology control algorithm, which is in...
Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenon. Because of the variable and unpredictable capacity of wireless links, packet loses may happen frequently. Several routing protocols have been proposed for Mobile Adhoc networks, yet there is no one for all schemes that works well in...
This paper investigates multi join queries in ad hoc wireless networks. A two-phase query optimization method is presented, which optimizes a query with two phases. First, it optimizes middle result of a query and produces optimal join sequence, which makes account of transmission data minimum. Second, the join tree from first phase is separated into several sub queries and distributed to the corresponding...
In this paper, we propose a banyan-tree topology for the railway wireless mesh network (WMN), which could normally stretch up to hundreds and thousands kilometer along the railway. Theoretical analysis and numerical studies show that the proposed banyan-tree topology is appropriate for the implementation of multi-hop WMN along the railway with improved network robust, and is feasible to deploy because...
In autonomous ad hoc networks, nodes may act in their self-interest to improve their performance, perhaps at the expense of other nodes', or even the overall network's, performance. Besides, nodes are often mobile and must contend with limited and obsolete information about the operating state of network during their decision-making. We examine topology control of ad hoc networks and analyze the impact...
Mobile ad hoc networks (MANET) are modeled as agents that form communities without infrastructure, for a random period of time and with usually cooperative behavior. The nodes of MANET often carry information to disseminate. The dynamics of information delivery, mostly referred as average consensus, is a common problem in these networks. The gossip protocols are designed to implement this task. The...
Attack graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through security perimeters and traverse a network to reach valuable assets deep inside the network. Although scalability is no longer the main issue, Attack Graphs still have some problems that make them less useful in practice. First, Attack...
This paper proposes a dynamic energy efficient clustering algorithm for mobile ad hoc networks (MANETs). The proposed algorithm elects first the nodes that have a higher energy and less mobility as cluster-heads, then periodically monitors the cluster-heads' energy and locally alters the network topology or the clusters to increase the network lifetime by reducing the energy consumption of the suffering...
This paper proposes a new token-based mutual exclusion algorithm for directed graph topology, with or without cycles. In one of our earlier works, we have introduced a token based algorithm assuming an inverted tree topology. Such a stable, hierarchical topology is quite unrealistic for mobile networks due to frequent link failures and node mobility. The proposed solution overcomes this. Besides maintaining...
This paper proposes a localization algorithm that can be used to track and locate multiple mobile subjects in a wireless ad hoc network. An algorithm called adaptive dynamic localization is proposed. It is based on a dynamic multidimensional scaling (DMDS) method which reduces the localization error by adding virtual nodes till the network turns adequately dense and connected. The shortcomings which...
Dynamic spectrum management (DSM) is a key feature for enhancing cooperation in wireless video sensor network (WVSN) towards supporting communication of high data-rate video information. Unlike traditional spectrum allocation, DSM in WVSN should have topology control and distributed control center. In this paper, we propose an ILST algorithm for constructing distributed DSM topology control with the...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.