اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficient Measurement of Complex Networks Using Link Queries
222
0
0.0
(
0
)
نشر من قبل
Cl\\'emence Magnien
تاريخ النشر
2009
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
Fabien Tarissan
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link queries: given two nodes, it is possible to test the existence of a link between them. These tests may be costly, and thus minimizing their number while maximizing the number of discovered links is a key issue. This paper studies this problem: we observe that properties classically observed on real-world complex networks give hints for their efficient measurement; we derive simple principles and several measurement strategies based on this, and experimentally evaluate their efficiency on real-world cases. In order to do so, we introduce methods to evaluate the efficiency of strategies. We also explore the bias that different measurement strategies may induce.
قيم البحث
اقرأ أيضاً
Community detection and link prediction are both of great significance in network analysis, which provide very valuable insights into topological structures of the network from different perspectives. In this paper, we propose a novel community detec
tion algorithm with inclusion of link prediction, motivated by the question whether link prediction can be devoted to improving the accuracy of community partition. For link prediction, we propose two novel indices to compute the similarity between each pair of nodes, one of which aims to add missing links, and the other tries to remove spurious edges. Extensive experiments are conducted on benchmark data sets, and the results of our proposed algorithm are compared with two classes of baseline. In conclusion, our proposed algorithm is competitive, revealing that link prediction does improve the precision of community detection.
With increasingly ambitious initiatives such as GENI and FIND that seek to design the future Internet, it becomes imperative to define the characteristics of robust topologies, and build future networks optimized for robustness. This paper investigat
es the characteristics of network topologies that maintain a high level of throughput in spite of multiple attacks. To this end, we select network topologies belonging to the main network models and some real world networks. We consider three types of attacks: removal of random nodes, high degree nodes, and high betweenness nodes. We use elasticity as our robustness measure and, through our analysis, illustrate that different topologies can have different degrees of robustness. In particular, elasticity can fall as low as 0.8% of the upper bound based on the attack employed. This result substantiates the need for optimized network topology design. Furthermore, we implement a tradeoff function that combines elasticity under the three attack strategies and considers the cost of the network. Our extensive simulations show that, for a given network density, regular and semi-regular topologies can have higher degrees of robustness than heterogeneous topologies, and that link redundancy is a sufficient but not necessary condition for robustness.
The recent development of wireless communication has provided many promising solutions to emergency response. To effectively realize the energy-efficient underwater emergency response and adequately harness merits of different underwater communicatio
n links (UCL), this article proposes an underwater emergency communication network (UECN) aided by multiple UCLs and autonomous underwater vehicles (AUV) to collect underwater emergency data. Specifically, we first select the optimal emergency response mode (ERM) for each underwater sensor node (USN) with the help of greedy searching and reinforcement learning (RL), and the isolated USNs (IUSN) can be found out. Second, based on the distribution of IUSNs, we dispatch AUVs to assist IUSNs in underwater communication by jointly solving the optimal AUV position and velocity, which can dramatically shorten the amount of time for data collection and motion. Finally, the best tradeoff between response efficiency and energy consumption is achieved by multiobjective optimization, where the amount of time for emergency response and the total energy consumption are simultaneously minimized, subject to a given set of transmit power, signal-to-interference-plus-noise ratio (SINR), outage probability, and energy constraints. Simulation results show that the proposed system significantly improves the response efficiency and overcomes the limitations of existing works, which makes contributions to emergency decision-making.
Complex bufferless networks such as on-chip networks and optical burst switching networks havent been paid enough attention in network science. In complex bufferless networks, the store and forward mechanism is not applicable, since the network nodes
are not allowed to buffer data packets. In this paper, we study the data transmission process in complex bufferless networks from the perspective of network science. Specifically, we use the Price model to generate the underlying network topological structures. We propose a delivery queue based deflection mechanism, which accompanies the efficient routing protocol, to transmit data packets in bufferless networks. We investigate the average deflection times, packets loss rate, average arrival time, and how the network topological structure and some other factors affect these transmission performances. Our work provides some clues for the architecture and routing design of bufferless networks.
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topolog
y and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a reliable greedy position based routing approach to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that packet delivery ratio is improved considerably compared to other routing techniques of VANET.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
