اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTopology Discovery for Linear Wireless Networks with Application to Train Backbone Inauguration
344
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A train backbone network consists of a sequence of nodes arranged in a linear topology. A key step that enables communication in such a network is that of topology discovery, or train inauguration, whereby nodes learn in a distributed fashion the physical topology of the backbone network. While the current standard for train inauguration assumes wired links between adjacent backbone nodes, this work investigates the more challenging scenario in which the nodes communicate wirelessly. The key motivations for this desired switch from wired topology discovery to wireless one are the flexibility and capability for expansion and upgrading of a wireless backbone. The implementation of topology discovery over wireless channels is made difficult by the broadcast nature of the wireless medium, and by fading and interference. A novel topology discovery protocol is proposed that overcomes these issues and requires relatively minor changes to the wired standard. The protocol is shown via analysis and numerical results to be robust to the impairments caused by the wireless channel including interference from other trains.
قيم البحث
اقرأ أيضاً
Topology Control (TC) aims at tuning the topology of highly dynamic networks to provide better control over network resources and to increase the efficiency of communication. Recently, many TC protocols have been proposed. The protocols are designed
for preserving connectivity, minimizing energy consumption, maximizing the overall network coverage or network capacity. Each TC protocol makes different assumptions about the network topology, environment detection resources, and control capacities. This circumstance makes it extremely difficult to comprehend the role and purpose of each protocol. To tackle this situation, a taxonomy for TC protocols is presented throughout this paper. Additionally, some TC protocols are classified based upon this taxonomy.
An energy cooperation policy for energy harvesting wireless sensor networks (WSNs) with wireless power transfer is proposed in this paper to balance the energy at each sensor node and increase the total energy utilization ratio of the whole WSNs. Con
sidering the unbalanced spatio-temporal properties of the energy supply across the deployment terrain of energy harvesting WSNs and the dynamic traffic load at each sensor node, the energy cooperation problem among sensor nodes is decomposed into two steps: the local energy storage at each sensor node based on its traffic load to meet its own needs; within the energy storage procedure sensor nodes with excess energy transmit a part of their energy to nodes with energy shortage through the energy trading. Inventory theory and game theory are respectively applied to solving the local energy storage problem at each sensor node and the energy trading problem among multiple sensor nodes. Numerical results show that compared with the static energy cooperation method without energy trading, the Stackelberg Model based Game we design in this paper can significantly improve the trading volume of energy thereby increasing the utilization ratio of the harvested energy which is unevenly distributed in the WSNs.
With the tremendous advances of the wireless devices technology, securing wireless sensor networks became more and more a vital but also a challenging task. In this paper we propose an integrated strategy that is meant to discover malicious nodes wit
hin a sensor network and to expel them from the network using a node self-destruction procedure. Basically, we will compare every sensor reading with its estimated values provided by two predictors: an autoregressive predictor [1] that uses past values provided by the sensor under investigation and a neural predictor that uses past values provided by adjacent nodes. In case the absolute difference between the measured and the estimated values are greater then a chosen threshold, the sensor node becomes suspicious and a decision block is activated. If this block decides that the node is malicious, a self-destruction procedure will be started.
In wireless communication systems, Quality of Service (QoS) is one of the most important issues from both the users and operators point of view. All the parameters related to QoS are not same important for all users and applications. The satisfaction
level of different users also does not depend on same QoS parameters. In this paper, we discuss the QoS parameters and then propose a priority order of QoS parameters based on protocol layers and service applications. We present the relation among the QoS parameters those influence the performance of other QoS parameters and, finally, we demonstrate the numerical analysis results for our proposed soft-QoS scheme to reduce the dropped call rate which is the most important QoS parameter for all types of services
We consider the problem of efficient packet dissemination in wireless networks with point-to-multi-point wireless broadcast channels. We propose a dynamic policy, which achieves the broadcast capacity of the network. This policy is obtained by first
transforming the original multi-hop network into a precedence-relaxed virtual single-hop network and then finding an optimal broadcast policy for the relaxed network. The resulting policy is shown to be throughput-optimal for the original wireless network using a sample-path argument. We also prove the NP-completeness of the finite-horizon broadcast problem, which is in contrast with the polynomial time solvability of the problem with point-to-point channels. Illustrative simulation results demonstrate the efficacy of the proposed broadcast policy in achieving the full broadcast capacity with low delay.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
