BeiDou satellites cross-regional communication path assignment model and resource management by Sheng Liu, Di Wu, Lanyong Zhang

“…The transition probability takes into account the communication environment, congestion status, aircraft mobility, and reduces the complexity of path assignment by hiding the topology in the region. At the same time, due to the limited resources of onboard computing, storage and bandwidth, we also design a resource management strategy based on task urgency, aimed at minimizing the unreasonable allocation index, to enable the readjustment of link application resources. …”
Get full text

Non-GPS Data Dissemination for VANET by Kulit Na Nakorn, Kultida Rojviboonchai

“…The algorithm is a combination of density based algorithm and topology based algorithm, called “DTA.” The algorithm does not require any geographical knowledge. …”
Get full text

Bionic Optimization Based Stability and Congestion Aware Routing Algorithm for Airborne Highly Dynamic Network by Yunlong Yu, Le Ru, Sheng Mao, Kangning Sun, Qiangqiang Yu, Kun Fang

“…Airborne highly dynamic ad hoc UAV network has features of high node mobility, fast changing network topology, and complex application environment. The performance of traditional routing algorithms is so poor over aspects such as end to end delay, data packet delivery ratio, and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. …”
Get full text

An Assessment of the Literature and Recent Developments on the Shallow Wake in an Open Channel Flow by Arindam Singha, Ramaswami Balachandar

“…The third and most recent group of investigations attempted to correlate the flow topology with the extent of the confinement and focused on more applied areas like control of wake instability and consequent effects on drag reduction, and the effect of the coherent structures on species transport. …”
Get full text

Quality of Service Comparison of DSDV and DSR Routing Protocols for V2V Communication in VANET by ketut bayu yogha bintoro, Muhammad Wildan Mukholladun

“…The results reveal that DSR excels in scenarios with rapid topology changes due to its lower routing overhead. …”
Get full text

Multipath inter-domain routing for named data networking by Xiao-yan HU, Jian GONG

“…To facilitate content retrieval among NDN domains,a multipath inter-domain routing for named data networking(MIRNDN)was proposed.Under MIRNDN,an AS(autonomous system)maintained merely the routing state of content reachable from its own network or from its customers’ networks and aggregated routing information to mitigate routing scalability issue; “valley free”routing policy was applied to guide Interest packets that solicit content unreachable from the AS’s own network nor from its customers’ networks to explore matching data packets via multiple paths,and NDN’s requests aggregation,in-network caching and adaptive forwarding optimized such exploration; the reachability information of content from multiple paths was collected to support Interest multipath forwarding.The properties of FIB size and the convergence time and communication cost of routing update under MIRNDN were analyzed in theory.The experimental results in the AS level topology of current Internet validates that MIRNDN mitigates the scalability issue of NDN inter-domain routing,has relative short convergence time and moderate communication cost for routing update,and effectively reduces unnecessary Interest forwarding.…”
Get full text

DS+: Reliable Distributed Snapshot Algorithm for Wireless Sensor Networks by Gamze Uslu, Kemal Cagri Serdaroglu, Sebnem Baydere

“…In this paper, we present a fully distributed snapshot acquisition algorithm adapted to tree topology wireless sensor networks (WSNs). Since snapshot acquisition is through control messages sent over highly lossy wireless channels and congested nodes, we enhanced the snapshot algorithm with a sink based reliability suit to achieve robustness. …”
Get full text

Opportunistic routing algorithm based on trust model for ad hoc network by Bo WANG, Xun-xun CHEN

“…Due to the absence of enough physical protection,dynamic topology,distributed collaboration,the limited bandwidth and computing ability in ad hoc network,traditional routing security mechanism cannot adapt to the design of routing protocols.Recently,opportunistic routing is of the research hotspots,which can cope with the unreliable transmissions to improve throughput of the whole network by exploiting the broadcast nature of the wireless medium and spatial diversity of multi-hop wireless network.The concept of trust-based similarity in opportunistic routing for ad hoc network was incorporated,and a novel trusted opportunistic forwarding model based on trust degree of node and least cost of opportunistic routing were also built.Then a trusted minimum cost routing algorithm (MCOR) was proposed and the correctness and effectiveness of this algorithm from theoretical ana ysis were proved.Finally,MCOR algorithm was verified by simulation and was compared with the classic protocols:ExOR,TAODV and Watchdog-DSR.The simulation results show that MCOR scheme can detect and mitigate node misbehaviors.Furthermore,MCOR scheme outperforms the other protocols in terms of throughput,delay,expected ETX and cost of routing.…”
Get full text

Research on distributed time synchronization methods for LEO communication constellations based on maximum likelihood estimation by YAN Bing, ZHAO Yafei, FANG Yiming, PENG Mugen, LIN Guangrong

“…The simulation results show that the synchronization error of the time synchronization method based on maximum likelihood estimation is less than 5 ns under the dynamic scenario and topology of LEO satellites.…”
Get full text

Emergent Behaviors in Coupled Multi-scroll Oscillators in Network with Subnetworks by Hector Gilardi-velázquez, Eber J. ávila-martínez, Bahia Betzavet Cassal-quiroga, Adrıana Ruiz-silva

“…Specifically, the nodes in these networks belong to a particular class of piece-wise linear systems. The global topology of the network is designed in the form of connected subnetworks, which do not necessarily share the same structure and coupling strength. …”
Get full text

Changes in hairiness of woven fabrics at the production and finishing stages by Krupincová Gabriela, Militký Jiří

“…The look and feel of fabrics are greatly influenced by their complex surface topology, which can be defined by two main properties: roughness and hairiness. …”
Get full text

Human Search in a Fitness Landscape: How to Assess the Difficulty of a Search Problem by Oana Vuculescu, Mads Kock Pedersen, Jacob F. Sherson, Carsten Bergenholtz

“…Based on comparative simulations and a new type of visualization of how to assess the nature of the fitness landscape, we address two key assumptions that approaches such as the NK framework rely on: that the NK captures the continuum of the complexity of empirical fitness landscapes and that search behavior is a distinct component, independent from the topology of the fitness landscape. We show the limitations of the most common approach to conceptualize how complex, or rugged, a landscape is, as well as how the nature of the fitness landscape is fundamentally intertwined with search behavior. …”
Get full text

Energy-efficient chain-based data gathering applied to communicating concrete by Hang Wan, Michael David, William Derigent

“…Due to applicative constraints, the topology of the wireless sensor network follows a chain-based structure. …”
Get full text

An advertisement dissemination strategy with maximal influence for Internet-of-Vehicles by Yanfei Lu, Zihan Zhao, Bowu Zhang, Qinghe Gao

“…In particular, we present the computation of node marginal gain in four cases by examining vehicle connectivity and topology. Simulation results demonstrate that the proposed algorithm outperforms existing methods for influence maximization by running time and deliver ratio under different traffic scenarios.…”
Get full text

An Online Map Matching Algorithm Based on Second-Order Hidden Markov Model by Xiao Fu, Jiaxu Zhang, Yue Zhang

“…Several factors such as driver’s travel preference, network topology, road level, and vehicle heading are well considered. …”
Get full text

Detailed Theoretical Model for Adjustable Gain-Clamped Semiconductor Optical Amplifier by Lin Liu, Craig Michie, Anthony E. Kelly, Ivan Andonovic

“…The adjustable gain-clamped semiconductor optical amplifier (AGC-SOA) uses two SOAs in a ring-cavity topology: one to amplify the signal and the other to control the gain. …”
Get full text

Novel Energy-Efficient Miner Monitoring System with Duty-Cycled Wireless Sensor Networks by Peng Guo, Tao Jiang, Kui Zhang

“…Moreover, as sensor nodes form an ultra-sparse network with linear topology in tunnels, it is a challenge for existing range-free localization methods to localize targets. …”
Get full text

Single event transient mitigation techniques for a cross‐coupled LC oscillator, including a single‐event transient hardened CMOS LC‐VCO circuit by Arumugam Karthigeyan, Sankararajan Radha, Esakkimuthu Manikandan

“…Also, a new SET tolerant inductor capacitor‐voltage controlled oscillator (LC‐VCO) topology is proposed for a radiation environment that shows reduced phase displacement, amplitude displacement, and recovery time. …”
Get full text

The role of order and disorder in thermal and material sciences part 2: Scientific world and new insights by Šesták Jaroslav

“…The part 2 reveals the impact of mathematics as explained on some simple cases showing development of basic ideas (vibration, topology, bifurcations etc). Earth thermal environment is discussed in relation to the existence of life (antropy principles). …”
Get full text

Low-latency neighbor discovery algorithm based on multi-beacon message in mobile low-duty-cycle sensor network by Junbin LIANG, Xiang ZHOU, Fangqiang MA, Chan JIANG, Zongjian HE

“…Neighbor discovery enables nodes in the networks to discover each other through simple information interaction,which was suitable for the new mobile low duty cycle sensor network (MLDC-WSN).However,because the nodes in MLDC-WSN can move randomly and sleep,the network topology was changed frequently,which results in that some nodes need a lot of energy and time to find their neighbors.How to realize fast neighbor discovery for all nodes in the network was a difficult problem in current research.To solve this problem,a new low-latency neighbor discovery algorithm based on multi-beacon messages was proposed.In this algorithm,the nodes were discovered by sending a short beacon message through their neighbor nodes,and by adjusting the time and frequency of beacon message sent,a lower neighbor discovery delay was obtained.Eventually,through quantitative analysis and simulation experiments,it is found that compared with existing algorithms,this algorithm can find all neighbor nodes in MLDC-WSN with less energy consumption,lower latency and greater probability.…”
Get full text