In order to extend the lifetime of wireless sensor network and avoid network premature invalidation caused by local emergency, this paper proposes an energy-efficient mobile routing algorithm (MREEMRP). The network ba...
详细信息
We investigate GPSR algorithms of WSN and propose an improved routing algorithm based on energy gradient and APIT grid to solve the problem of high and unbalanced energy consumption of GPSR. In GPSR, network uses gree...
详细信息
We investigate GPSR algorithms of WSN and propose an improved routing algorithm based on energy gradient and APIT grid to solve the problem of high and unbalanced energy consumption of GPSR. In GPSR, network uses greedy algorithm and right-hand rule to establish routing paths, and the path keeps running till some nodes within the path are invalid because energy is exhausted, which would lead to the high energy consumption of some nodes in the path and the low energy consumption of others nearby the nodes not in the path as well as bringing high and unbalanced energy consumption of the network. Regarding these problems, we use APIT localization algorithm and APIT grid to query and establish routing paths and establish the corresponding energy gradient when messages are transmitted along the routing paths. When some nodes are approaching the threshold status, we use right-hand rule and recursion greedy algorithm in advance to plan a new routing path towards the target area. When query messages arrive at the event area, the network uses a different method to transmit data according to the density of sensor nodes. Simulation experiments show that the improved routing algorithm is capable of reducing the energy consumption of network and extending the lifecycle of network.
In recent years, the research of individual wearable physiological monitoring wireless sensor network is in the primary stage. The monitor of physiology and geographical position used in wearable wireless sensor netwo...
详细信息
In recent years, the research of individual wearable physiological monitoring wireless sensor network is in the primary stage. The monitor of physiology and geographical position used in wearable wireless sensor network requires performances such as real time, reliability, and energy balance. According to these requirements, this paper introduces a design of individual wearable wireless sensor network monitoring system;what is more important, based on this background, this paper improves the classical Collection Tree Protocol and puts forward the improved routing protocol F-CTP based on the fuzzy logic routing algorithm. Simulation results illustrate that, with the F-CTP protocol, the sensor node can transmit data to the sink node in real time with higher reliability and the energy of the nodes consumes balance. The sensor node can make full use of network resources reasonably and prolong the network life.
Upcoming reconfigurable Multiprocessor Systems-on-Chip (MPSoCs) present new challenges for the design and early estimation of technology requirements due to their runtime adaptive hardware architecture. The usage of s...
详细信息
Upcoming reconfigurable Multiprocessor Systems-on-Chip (MPSoCs) present new challenges for the design and early estimation of technology requirements due to their runtime adaptive hardware architecture. The usage of simulators offers capabilities to overcome these issues. In this article, MPSoCSim, a SystemC simulator for Network-on-Chip (NoC) based MPSoCs is extended to support the simulation of reconfigurable MPSoCs. Processors, such as ARM and MicroBlaze, and peripheral models used within the virtual platform are provided by Imperas/OVP and attached to the NoC. Moreover, traffic generators are available to analyze the system. The virtual platform currently supports mesh topology with wormhole switching and several routing algorithms such as XY-, a minimal West-First algorithm, and an adaptive West-First algorithm. Amongst the impact of routing algorithms regarding performance, reconfiguration processes can be examined using the presented simulator. A mechanism for dynamic partial reconfiguration is implemented that is oriented towards the reconfiguration scheme on real FPGA platforms. It includes the simulation of the undefined behavior of the hardware region during reconfiguration and allows the adjustment of parameters. During runtime, dynamic partial reconfiguration interfaces are used to connect the Network-on-Chip infrastructure with reconfigurable regions. The configuration access ports can be modeled by the controller for the dynamic partial reconfiguration in form of an application programming interface. An additional SystemC component enables the readout of simulation time from within the application. For evaluation of the simulator timing and power consumption of the simulated hardware are estimated and compared with a real hardware implementation on a Xilinx Zynq FPGA. The comparison shows that the simulator improves the development of reconfigurable MPSoCs by early estimation of system requirements. The power estimations show a maximum deviation of 9m
Recently wireless sensor network (WSN) has become one of the most interesting networking technologies, since it can be deployed without communication infrastructures. A sensor network is composed of a large number of ...
详细信息
Recently wireless sensor network (WSN) has become one of the most interesting networking technologies, since it can be deployed without communication infrastructures. A sensor network is composed of a large number of sensor nodes;these nodes are responsible for supervision of the physical phenomenon and transmission of the periodical results to the base station. Therefore, improving the energy efficiency and maximizing the networking lifetime are the major challenges in this kind of networks. To deal with this, a hierarchical clustering scheme, called Location-Energy Spectral Cluster Algorithm (LESCA), is proposed in this paper. LESCA determines automatically the number of clusters in a network. It is based on spectral classification and considers both the residual energy and some properties of nodes. In fact, our approach uses the K-ways algorithm and proposes new features of the network nodes such as average energy, distance to BS, and distance to clusters centers in order to determine the clusters and to elect the cluster's heads of a WSN. The simulation results show that if the clusters are not constructed in an optimal way and/or the number of the clusters is greater or less than the optimal number of clusters, the total consumed energy of the sensor network per round is increased exponentially.
Increasing fault rates in current and future technology nodes coupled with on-chip components in the hundreds calls for robust and fault-tolerant Network-on-Chip (NoC) designs. Given the central role of NoCs in today&...
详细信息
Increasing fault rates in current and future technology nodes coupled with on-chip components in the hundreds calls for robust and fault-tolerant Network-on-Chip (NoC) designs. Given the central role of NoCs in today's many-core chips, permanent faults impeding their original functionality may significantly influence performance, energy consumption, and correct operation of the entire system. As a result, fault-tolerant NoC design gained much attention in recent years. In this article, we review the vast research efforts regarding a NoC's components, namely, topology, routing algorithm, router microarchitecture, as well as system-level approaches combined with reconfiguration;discuss the proposed architectures;and identify outstanding research questions.
In this paper, we propose a mobility model for opportunistic networks in a commercial area (MMCA). The commercial area is divided into two parts: internal and external areas. We modified the traditional susceptible-in...
详细信息
The work contains a first attempt to treat the problem of routing in networks with energy harvesting units. We propose HDR - a Hysteresis Based routing Algorithm and analyse it in a simple diamond network. The results...
详细信息
ISBN:
(纸本)9781467373067
The work contains a first attempt to treat the problem of routing in networks with energy harvesting units. We propose HDR - a Hysteresis Based routing Algorithm and analyse it in a simple diamond network. The results are used to give insight into its application in general topology networks.
The cost and reliability issues of TSVs move 3D-NoCs toward heterogonous designs with limited number of TSVs. However, designing a deadlock-free routing algorithm for such heterogonous architectures is extremely chall...
详细信息
ISBN:
(纸本)9781479984909
The cost and reliability issues of TSVs move 3D-NoCs toward heterogonous designs with limited number of TSVs. However, designing a deadlock-free routing algorithm for such heterogonous architectures is extremely challenging due to the increased possibilities of forming cycles between and within layers for 3D designs. In this paper, we target designing a routing algorithm for heterogeneous 3D-NoCs with the capability of working under the technical limit in which there is just one TSV in the network. This algorithm is light-weight and provides adaptivity by using only one virtual channel along the Y dimension.
A novel routing algorithm is presented to avoid the impact of process variation and congestion for asynchronous NoC design. Process variation Delay and Congestion aware routing (PDCR) is proposed as adaptive, low cost...
详细信息
ISBN:
(纸本)9781479989379
A novel routing algorithm is presented to avoid the impact of process variation and congestion for asynchronous NoC design. Process variation Delay and Congestion aware routing (PDCR) is proposed as adaptive, low cost and scalable routing algorithm. The performance of PDCR with process variation is determined as compared with different routing algorithms under various traffic patterns. The saturation throughput and average message delay are used as performance metrics. PDCR outperforms different adaptive routing algorithms using various traffic patterns. PDCR can achieve up to 12% - 32% average message delay lower than that of other routing algorithms. Moreover, the proposed scheme yields improvements in saturation throughput by up to 11% - 82% compared with other adaptive routing algorithms.
暂无评论