نتایج جستجو برای: hop roman dominating function
تعداد نتایج: 1248103 فیلتر نتایج به سال:
One of the important issues in wireless networks is the Routing problem that is effective on system performance, in this article the attempt is made to propose a routing algorithm using the bee colony in order to reduce energy consumption in wireless relay networks. In EBCD algorithm, through combined of energy, distance and traffic parameters a routing algorithm for wireless networks is presen...
Multipoint relays o er an optimized way of ooding packets in a radio network. However, this technique requires the last hop knowledge: to decide wether or not a ooding packet is retransmitted, a node needs to know from which node the packet was received. When considering broadcasting at IP level, this information may be di cult to obtain. We thus propose a scheme for computing an optimized conn...
A Connected Dominating Set (CDS) based virtual backbone plays an important role in wireless ad hoc networks for efficient routing and broadcasting. Each node in the network can select some of its 1-hop neighbors as Multi Point Relay (MPR) to cover all its 2-hop neighbors. A MPR based CDS is a promising approach for broadcasting. A node in the CDS consumes more energy and the energy depletes qui...
Purpose: The present study aimed to investigate the effect of six weeks of Pilates exercises on upper and lower extremities function in middle-aged females with lower crossed syndrome. Methods: This study was a quasi-experimental research with pretest- post-test design. The participants were 30 females with lower crossed syndrome from Tiam Sport Club. They were selected using purposeful sampl...
1)فرض کنید g=(v,e) یک گراف ساده باشد.همسا یگی بسته رأس v?v را بصورت زیر نشان می دهیم : n[v]={u:uv?e}?{v} 2)تابعf:v?{-1,1} را تابع غالب علامت دار(signed dominating function یا به اختصار s.d.f) نامیم هرگاه به ازای هر v?v داشته باشیم f[v]=?_(u?n[v])?f(u) ?1:. 3)وزنfکه یکsdfمی باشد به صورت مقابل تعریف می شود: f(g)=?_(v?v)?f(v) . 4)می نیمم وزن تابع غالب علامتدار تعریف شده روی گراف g را با نماد?_s ...
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends the same message to all the network. Routing problem deals with finding a route between a source and a destination. In the activity-scheduling problem, each node decides between active or passive state. We present a sche...
Mobile Ad hoc Network (MANET) is the cooperative engagement of a collection of wireless mobile nodes without the support of any centralized access point or existing infrastructure. The use of virtual topologies is a good alternative to build wireless multi-hop networks. It aims to maintain a topology that optimizes broadcasting or network performances. The problem is to determine an appropriate...
. Let G be a connected graph. A set S ⊆ V (G) is an outer-connected 2-resolving hop dominating of if and = or the subgraph ⟨V (G)\S⟩ induced by (G)\S connected. The domination number G, denoted γ^c2Rh(G) smallest cardinality G. This study aims to combine concept with sets graphs. main results generated in this include characterization join, corona, edge corona lexicographic product graphs, as w...
Service discovery is a crucial feature for the usability of mobile ad-hoc networks (MANETs). In this paper, Minimum Dominating Forward Node Set based Service Discovery Protocol (MDFNSSDP) is proposed. MDFNSSDP has the following characteristics: 1)It minimizes the number of coverage demanding nodes in the current node’s 2-hop neighbor set. 2) It minimizes the size of dominating forward node set ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید