This document proposes two genetic algorithm based methodologies called Minimum Spanning Tree First (MSTF) and Shortest Paths First (SPF) for designing customized and energy optimized irregular Network-on-Chip (NoC) topologies tailored to an application's communication characteristics. The MSTF methodology first constructs a minimum spanning tree and then extends the topology by adding shortest energy paths, while SPF first finds the shortest energy paths and then constructs the minimum spanning tree. Experimental results on random benchmarks show the SPF methodology reduces average dynamic communication energy by 18.5% on average compared to MSTF. SPF also achieves lower latency and similar throughput. Comparisons with regular 2D mesh NoCs and an intelligent mapping
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
TriBA(Triplet Based Architecture) is a Network on Chip processor(NoC) architecture which merges the
core philosophy of Object Oriented Design with the hardware design of multicore processors[1].We
present TriBASim in this paper, a NoC simulator specifically designed for TriBA.In TriBA ,nodes are
connected in recursive triplets .TriBA network topology performance analysis have been carried out from
different perspectives [2] and routing algorithms have been developed [3][4] but the architecture still lacks
a simulator that the researcher can use to run simple and fast behavioural analysis on the architecture
based on common parameters in the Network On Chip arena. TriBASim is introduced in this paper ,a
simulator for TriBA ,based on systemc[6] .TriBASim will lessen the burden on researchers on TriBA ,by
giving them something to just plug in desired parameters and have nodes and topology set up ready for
analysis.
Design of area and power efficient half adder using transmission gateeSAT Journals
Abstract This paper gives an idea to reduce power and surface area of half adder circuit using very popular technique i.e. transmission gate. An adder is a digital circuit that performs addition of two numbers. In many computers and other kind of processors, adders are used not only in arithmetic logic unit but also in other parts of the processors where they are used to calculate addresses, table indices and similar operations .in this paper two bit addition has been done using conventional and transmission gate level and power, area and number of transistors are the scope of comparison. According to the simulation result, power and area are reduced by 55.35 % and 40.269% respectively when the circuit is implemented by transmission gate .thus transmission gate has become a very popular and useful technique to implement digital circuits which help to reduce power, surface area as well as number of transistors. Keywords: Transmission gate (TG), Half adder, CMOS logic gates, Surface area, Power.
Convolutional Neural Network and Feature Transformation for Distant Speech Re...IJECEIAES
In many applications, speech recognition must operate in conditions where there are some distances between speakers and the microphones. This is called distant speech recognition (DSR). In this condition, speech recognition must deal with reverberation. Nowadays, deep learning technologies are becoming the the main technologies for speech recognition. Deep Neural Network (DNN) in hybrid with Hidden Markov Model (HMM) is the commonly used architecture. However, this system is still not robust against reverberation. Previous studies use Convolutional Neural Networks (CNN), which is a variation of neural network, to improve the robustness of speech recognition against noise. CNN has the properties of pooling which is used to find local correlation between neighboring dimensions in the features. With this property, CNN could be used as feature learning emphasizing the information on neighboring frames. In this study we use CNN to deal with reverberation. We also propose to use feature transformation techniques: linear discriminat analysis (LDA) and maximum likelihood linear transformation (MLLT), on mel frequency cepstral coefficient (MFCC) before feeding them to CNN. We argue that transforming features could produce more discriminative features for CNN, and hence improve the robustness of speech recognition against reverberation. Our evaluations on Meeting Recorder Digits (MRD) subset of Aurora-5 database confirm that the use of LDA and MLLT transformations improve the robustness of speech recognition. It is better by 20% relative error reduction on compared to a standard DNN based speech recognition using the same number of hidden layers.
Distributed MAC Protocol for Cognitive Radio Networks: Design, Analysis, and ...Polytechnique Montreal
In this paper, we investigate the joint optimal sensing and distributed Medium Access Control (MAC) protocol design problem for cognitive radio (CR) networks. We consider both scenarios with single and multiple channels. For each scenario, we design a synchronized MAC protocol for dynamic spectrum sharing among multiple secondary users (SUs), which incorporates spectrum sensing for protecting active primary users (PUs). We perform saturation throughput analysis for the corresponding proposed MAC protocols that explicitly capture the spectrum-sensing performance. Then, we find their optimal configuration by formulating throughput maximization problems subject to detection probability constraints for PUs. In particular, the optimal solution of the optimization problem returns the required sensing time for PUs' protection and optimal contention window to maximize the total throughput of the secondary network. Finally, numerical results are presented to illustrate developed theoretical findings in this paper and significant performance gains of the optimal sensing and protocol configuration.
Some Studies on Different Power Allocation Schemes of Superposition Modulationidescitation
Superposition Modulation/Mapping (SM) is a newly
evolving modulation technique in which the conversion from
binary digits to symbols is done by linear superposition of the
binary digits instead of bijective (one-to-one) mapping. Due
to linear superposition, the symbol distribution of the data
symbols thus formed are Gaussian shaped which is capacity
achieving without active signal shaping. In this paper, a detailed
study on SM has been presented with respect to its different
power allocation schemes namely Equal Power Allocation
(EPA), Unequal Power Allocation (UPA) and Grouped Power
Allocation (GPA). Also, it has been shown that SM is more
capacity achieving than the conventional modulation
technique such as Quadrature Amplitude Modulation (QAM)
Aiming at the problem that existing femtocell base station searching the optimal clustering scheme based on the clustering resource allocation algorithm is complex. We propose that building an conflict graph and adjacency matrix before clustering to calculate the number of clusters needed for FBS group by using the adaptive clustering heuristic algorithm. We follow maximization the sum of the FBS distances in the cluster and group the femtocell base stations to narrow the search range to reduce the computational complexity. In order to achieve different business types service, based on the above clustering algorithm, this paper proposes a new method that using the weighted energy efficiency, which including the user interruption and the network spectral efficiency as a fitness function of the power control scheme to solve the problem. The simulation results show that the same rate requirement reduces the complexity, while the same complexity increases the user's average rate.
MIMO System Performance Evaluation for High Data Rate Wireless Networks usin...IJMER
Space–time block coding is used for data communication in fading channels by multiple
transmit antennas. Message data is encoded by applying a space–time block code and after the encoding
the data is break into ‘n’ streams of simultaneously transmitted strings through n transmit antennas. The
received signal at the receiver end is the superposition of the n transmitted signals distorted due to noise
.For data recovery maximum likelihood decoding scheme is applied through decoupling of the signals
transmitted from different antennas instead of joint detection. The maximum likelihood decoding scheme
applies the orthogonal structure of the space–time block code (OSTBC) and gives a maximum-likelihood
decoding algorithm based on linear processing at the receiver. In this paper orthogonal space–time
block codes based model is developed using Matlab/Simulink to get the maximum diversity order for a
given number of transmit and receive antennas subject with a simple decoding algorithm.
The simulink block of orthogonal space coding block with space–time block codes is applied with and
without gray coding. The OSTBC codes gives the maximum possible transmission rate for any number of
transmit antennas using any arbitrary real constellation such of M-PSK array. For different complex
constellation of M- PSK space–time block codes are applied that achieve 1/2 and 3/4 of the maximum
possible transmission rate for MIMO transmit antennas using different complex constellations.
In recent years, cooperative communication is a hot topic of research and it is a powerful physical layer
technique to combat fading in wireless relaying scenario. Concerning with the physical layer issues, in this
paper it is focussed on with providing a better space time block coding (STBC) scheme and incorporating it
in the cooperative relaying nodes to upgrade the system performance. Recently, the golden codes have
proven to exhibit a superior performance in a wireless MIMO (Multiple Input Multiple Output) scenario
than any other code. However, a serious limitation associated with it is its increased decoding complexity.
This paper attempts to resolve this challenge through suitable modification of golden code such that a less
complex sphere decoder could be used without much compromising the error rates. The decoder complexity
is analyzed through simulation and it proves to exhibit less complexity compared to the conventional
(Maximum likelihood) ML decoder. The single relay cooperative STBC consisting of source, relay and
destination are considered. The cooperative protocol strategy considered in the relay node is Decode and
forward (DF) protocol. The proposed modified golden code with less complex sphere decoder is
implemented in the nodes of the cooperative relaying system to achieve better performance in the system.
The simulation results have validated the effectiveness of the proposed scheme by offering better BER
performance, minimum outage probability and increased spectral efficiency compared to the non
cooperative transmission method.
Energy efficiency is one of the most critical issue in design of System on Chip. In Network On
Chip (NoC) based system, energy consumption is influenced dramatically by mapping of
Intellectual Property (IP) which affect the performance of the system. In this paper we test the
antecedently extant proposed algorithms and introduced a new energy proficient algorithm
stand for 3D NoC architecture. In addition a hybrid method has also been implemented using
bioinspired optimization (particle swarm optimization) technique. The proposed algorithm has
been implemented and evaluated on randomly generated benchmark and real life application
such as MMS, Telecom and VOPD. The algorithm has also been tested with the E3S benchmark
and has been compared with the existing algorithm (spiral and crinkle) and has shown better
reduction in the communication energy consumption and shows improvement in the
performance of the system. Comparing our work with spiral and crinkle, experimental result
shows that the average reduction in communication energy consumption is 19% with spiral and
17% with crinkle mapping algorithms, while reduction in communication cost is 24% and 21%
whereas reduction in latency is of 24% and 22% with spiral and crinkle. Optimizing our work
and the existing methods using bio-inspired technique and having the comparison among them
an average energy reduction is found to be of 18% and 24%.
TriBA(Triplet Based Architecture) is a Network on Chip processor(NoC) architecture which merges the
core philosophy of Object Oriented Design with the hardware design of multicore processors[1].We
present TriBASim in this paper, a NoC simulator specifically designed for TriBA.In TriBA ,nodes are
connected in recursive triplets .TriBA network topology performance analysis have been carried out from
different perspectives [2] and routing algorithms have been developed [3][4] but the architecture still lacks
a simulator that the researcher can use to run simple and fast behavioural analysis on the architecture
based on common parameters in the Network On Chip arena. TriBASim is introduced in this paper ,a
simulator for TriBA ,based on systemc[6] .TriBASim will lessen the burden on researchers on TriBA ,by
giving them something to just plug in desired parameters and have nodes and topology set up ready for
analysis.
Design of area and power efficient half adder using transmission gateeSAT Journals
Abstract This paper gives an idea to reduce power and surface area of half adder circuit using very popular technique i.e. transmission gate. An adder is a digital circuit that performs addition of two numbers. In many computers and other kind of processors, adders are used not only in arithmetic logic unit but also in other parts of the processors where they are used to calculate addresses, table indices and similar operations .in this paper two bit addition has been done using conventional and transmission gate level and power, area and number of transistors are the scope of comparison. According to the simulation result, power and area are reduced by 55.35 % and 40.269% respectively when the circuit is implemented by transmission gate .thus transmission gate has become a very popular and useful technique to implement digital circuits which help to reduce power, surface area as well as number of transistors. Keywords: Transmission gate (TG), Half adder, CMOS logic gates, Surface area, Power.
Convolutional Neural Network and Feature Transformation for Distant Speech Re...IJECEIAES
In many applications, speech recognition must operate in conditions where there are some distances between speakers and the microphones. This is called distant speech recognition (DSR). In this condition, speech recognition must deal with reverberation. Nowadays, deep learning technologies are becoming the the main technologies for speech recognition. Deep Neural Network (DNN) in hybrid with Hidden Markov Model (HMM) is the commonly used architecture. However, this system is still not robust against reverberation. Previous studies use Convolutional Neural Networks (CNN), which is a variation of neural network, to improve the robustness of speech recognition against noise. CNN has the properties of pooling which is used to find local correlation between neighboring dimensions in the features. With this property, CNN could be used as feature learning emphasizing the information on neighboring frames. In this study we use CNN to deal with reverberation. We also propose to use feature transformation techniques: linear discriminat analysis (LDA) and maximum likelihood linear transformation (MLLT), on mel frequency cepstral coefficient (MFCC) before feeding them to CNN. We argue that transforming features could produce more discriminative features for CNN, and hence improve the robustness of speech recognition against reverberation. Our evaluations on Meeting Recorder Digits (MRD) subset of Aurora-5 database confirm that the use of LDA and MLLT transformations improve the robustness of speech recognition. It is better by 20% relative error reduction on compared to a standard DNN based speech recognition using the same number of hidden layers.
Distributed MAC Protocol for Cognitive Radio Networks: Design, Analysis, and ...Polytechnique Montreal
In this paper, we investigate the joint optimal sensing and distributed Medium Access Control (MAC) protocol design problem for cognitive radio (CR) networks. We consider both scenarios with single and multiple channels. For each scenario, we design a synchronized MAC protocol for dynamic spectrum sharing among multiple secondary users (SUs), which incorporates spectrum sensing for protecting active primary users (PUs). We perform saturation throughput analysis for the corresponding proposed MAC protocols that explicitly capture the spectrum-sensing performance. Then, we find their optimal configuration by formulating throughput maximization problems subject to detection probability constraints for PUs. In particular, the optimal solution of the optimization problem returns the required sensing time for PUs' protection and optimal contention window to maximize the total throughput of the secondary network. Finally, numerical results are presented to illustrate developed theoretical findings in this paper and significant performance gains of the optimal sensing and protocol configuration.
Some Studies on Different Power Allocation Schemes of Superposition Modulationidescitation
Superposition Modulation/Mapping (SM) is a newly
evolving modulation technique in which the conversion from
binary digits to symbols is done by linear superposition of the
binary digits instead of bijective (one-to-one) mapping. Due
to linear superposition, the symbol distribution of the data
symbols thus formed are Gaussian shaped which is capacity
achieving without active signal shaping. In this paper, a detailed
study on SM has been presented with respect to its different
power allocation schemes namely Equal Power Allocation
(EPA), Unequal Power Allocation (UPA) and Grouped Power
Allocation (GPA). Also, it has been shown that SM is more
capacity achieving than the conventional modulation
technique such as Quadrature Amplitude Modulation (QAM)
Aiming at the problem that existing femtocell base station searching the optimal clustering scheme based on the clustering resource allocation algorithm is complex. We propose that building an conflict graph and adjacency matrix before clustering to calculate the number of clusters needed for FBS group by using the adaptive clustering heuristic algorithm. We follow maximization the sum of the FBS distances in the cluster and group the femtocell base stations to narrow the search range to reduce the computational complexity. In order to achieve different business types service, based on the above clustering algorithm, this paper proposes a new method that using the weighted energy efficiency, which including the user interruption and the network spectral efficiency as a fitness function of the power control scheme to solve the problem. The simulation results show that the same rate requirement reduces the complexity, while the same complexity increases the user's average rate.
MIMO System Performance Evaluation for High Data Rate Wireless Networks usin...IJMER
Space–time block coding is used for data communication in fading channels by multiple
transmit antennas. Message data is encoded by applying a space–time block code and after the encoding
the data is break into ‘n’ streams of simultaneously transmitted strings through n transmit antennas. The
received signal at the receiver end is the superposition of the n transmitted signals distorted due to noise
.For data recovery maximum likelihood decoding scheme is applied through decoupling of the signals
transmitted from different antennas instead of joint detection. The maximum likelihood decoding scheme
applies the orthogonal structure of the space–time block code (OSTBC) and gives a maximum-likelihood
decoding algorithm based on linear processing at the receiver. In this paper orthogonal space–time
block codes based model is developed using Matlab/Simulink to get the maximum diversity order for a
given number of transmit and receive antennas subject with a simple decoding algorithm.
The simulink block of orthogonal space coding block with space–time block codes is applied with and
without gray coding. The OSTBC codes gives the maximum possible transmission rate for any number of
transmit antennas using any arbitrary real constellation such of M-PSK array. For different complex
constellation of M- PSK space–time block codes are applied that achieve 1/2 and 3/4 of the maximum
possible transmission rate for MIMO transmit antennas using different complex constellations.
In recent years, cooperative communication is a hot topic of research and it is a powerful physical layer
technique to combat fading in wireless relaying scenario. Concerning with the physical layer issues, in this
paper it is focussed on with providing a better space time block coding (STBC) scheme and incorporating it
in the cooperative relaying nodes to upgrade the system performance. Recently, the golden codes have
proven to exhibit a superior performance in a wireless MIMO (Multiple Input Multiple Output) scenario
than any other code. However, a serious limitation associated with it is its increased decoding complexity.
This paper attempts to resolve this challenge through suitable modification of golden code such that a less
complex sphere decoder could be used without much compromising the error rates. The decoder complexity
is analyzed through simulation and it proves to exhibit less complexity compared to the conventional
(Maximum likelihood) ML decoder. The single relay cooperative STBC consisting of source, relay and
destination are considered. The cooperative protocol strategy considered in the relay node is Decode and
forward (DF) protocol. The proposed modified golden code with less complex sphere decoder is
implemented in the nodes of the cooperative relaying system to achieve better performance in the system.
The simulation results have validated the effectiveness of the proposed scheme by offering better BER
performance, minimum outage probability and increased spectral efficiency compared to the non
cooperative transmission method.
Energy efficiency is one of the most critical issue in design of System on Chip. In Network On
Chip (NoC) based system, energy consumption is influenced dramatically by mapping of
Intellectual Property (IP) which affect the performance of the system. In this paper we test the
antecedently extant proposed algorithms and introduced a new energy proficient algorithm
stand for 3D NoC architecture. In addition a hybrid method has also been implemented using
bioinspired optimization (particle swarm optimization) technique. The proposed algorithm has
been implemented and evaluated on randomly generated benchmark and real life application
such as MMS, Telecom and VOPD. The algorithm has also been tested with the E3S benchmark
and has been compared with the existing algorithm (spiral and crinkle) and has shown better
reduction in the communication energy consumption and shows improvement in the
performance of the system. Comparing our work with spiral and crinkle, experimental result
shows that the average reduction in communication energy consumption is 19% with spiral and
17% with crinkle mapping algorithms, while reduction in communication cost is 24% and 21%
whereas reduction in latency is of 24% and 22% with spiral and crinkle. Optimizing our work
and the existing methods using bio-inspired technique and having the comparison among them
an average energy reduction is found to be of 18% and 24%.
Design and Implementation of Multistage Interconnection Networks for SoC Netw...IJCSEIT Journal
In this paper the focus is on a family of Interconnection Networks (INs) known as Multistage
Interconnection Networks (MINs). When it is exploited in Network-on-Chip (NoC) architecture designs,
smaller circuit area, lower power consumption, less junctions and broader bandwidth can be achieved.
Each MIN can be considered as an alternative for an NoC architecture design for its simple topology and
easy scalability with low degree. This paper includes two major contributions. First, it compares the
performance of seven prominent MINs (i.e. Omega, Butterfly, Flattened Butterfly, Flattened Baseline,
Generalized Cube, Beneš and Clos networks) based on 45nm-CMOS technology and under different types
of Synthetic and Trace-driven workloads. Second, a network called Meta-Flattened Network (MFN), was
introduced that can decrease the blocking probability by means of reduction the number of hops and
increase the intermediate paths between stages. This is also led into significant decrease in power
consumption.
Particle Swarm Optimization–Long Short-Term Memory based Channel Estimation w...IJCNCJournal
Non-Orthogonal Multiple Access (NOMA) helps to overcome various difficulties in future technology wireless communications. NOMA, when utilized with millimeter wave multiple-input multiple-output (MIMO) systems, channel estimation becomes extremely difficult. For reaping the benefits of the NOMA and mm-Wave combination, effective channel estimation is required. In this paper, we propose an enhanced particle swarm optimization based long short-term memory estimator network (PSOLSTMEstNet), which is a neural network model that can be employed to forecast the bandwidth required in the mm-Wave MIMO network. The prime advantage of the LSTM is that it has the capability of dynamically adapting to the functioning pattern of fluctuating channel state. The LSTM stage with adaptive coding and modulation enhances the BER.PSO algorithm is employed to optimize input weights of LSTM network. The modified algorithm splits the power by channel condition of every single user. Participants will be first sorted into distinct groups depending upon respective channel conditions, using a hybrid beamforming approach. The network characteristics are fine-estimated using PSO-LSTMEstNet after a rough approximation of channels parameters derived from the received data.
PARTICLE SWARM OPTIMIZATION–LONG SHORTTERM MEMORY BASED CHANNEL ESTIMATION WI...IJCNCJournal
Non-Orthogonal Multiple Access (NOMA) helps to overcome various difficulties in future technology wireless communications. NOMA, when utilized with millimeter wave multiple-input multiple-output (MIMO) systems, channel estimation becomes extremely difficult. For reaping the benefits of the NOMA and mm-Wave combination, effective channel estimation is required. In this paper, we propose an enhanced particle swarm optimization based long short-term memory estimator network (PSOLSTMEstNet), which is a neural network model that can be employed to forecast the bandwidth required in the mm-Wave MIMO network. The prime advantage of the LSTM is that it has the capability of dynamically adapting to the functioning pattern of fluctuating channel state. The LSTM stage with adaptive coding and modulation enhances the BER.PSO algorithm is employed to optimize input weights of LSTM network. The modified algorithm splits the power by channel condition of every single user. Participants will be first sorted into distinct groups depending upon respective channel conditions, using a hybrid beamforming approach. The network characteristics are fine-estimated using PSO-LSTMEstNet after a rough approximation of channels parameters derived from the received data
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
Smart parking is common in contemporary cities. These smart parking lots are outfitted mostly with wireless sensor networks (WSNs), which are used to detect, monitor, and collect data on the availability status of all existing parking spaces in a given area. Sensors make up WSN, which may gather, process, and transmit informations to the sink. However, the power and
communication limitations of the sensors have an effect on the performance and quality of the WSNs. The decrease in the battery and the energy of the
nodes causes a decrease in the life of the nodes and also of the entire WSN network. In this article, we present a routing protocol that implements an
efficient and robust algorithm allowing the creation of clusters so that the base station can receive data from the entire WSN network. This protocol
adopts a reliable and efficient algorithm allowing to minimize the energy dissipation of the sensors and to increase the lifetime of the WSN. In
comparison to alternative parking lot management protocols already in use,
the simulation results of the proposed protocol are effective and robust in terms of power consumption, data transmission reliability, and WSN network longevity.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Iterative network channel decoding with cooperative space-time transmissionijasuc
One of the most efficient methods of exploiting space diversity for portable wireless devices is cooperative
communication utilizing space-time block codes. In cooperative communication, users besides
communicating their own information, also relay the information of other users. In this paper we
investigate a scheme where cooperation is achieved using two methods, namely, distributed space-time
coding and network coding. Two cooperating users utilize Alamouti space time code for inter-user
cooperation and in addition utilize a third relay which performs network coding. The third relay does not
have any of its information to be sent. In this paper we propose a scheme utilizing convolutional code based
network coding, instead of conventional XOR based network code and utilize iterative joint networkchannel
decoder for efficient decoding. Extrinsic information transfer (EXIT) chart analysis is performed to
investigate the convergence property of the proposed decoder.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
Reconfigurable intelligent surface passive beamforming enhancement using uns...IJECEIAES
Reconfigurable intelligent surfaces (RIS) is a wireless technology that has the potential to improve cellular communication systems significantly. This paper considers enhancing the RIS beamforming in a RIS-aided multiuser multi-input multi-output (MIMO) system to enhance user throughput in cellular networks. The study offers an unsupervised/deep neural network (U/DNN) that simultaneously optimizes the intelligent surface beamforming with less complexity to overcome the non-convex sum-rate problem difficulty. The numerical outcomes comparing the suggested approach to the near-optimal iterative semi-definite programming strategy indicate that the proposed method retains most performance (more than 95% of optimal throughput value when the number of antennas is 4 and RIS’s elements are 30) while drastically reducing system computing complexity.
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...IJERA Editor
Network Coding is most promising aspect of WSN. This Network Coding method is combined with multipath routing protocol to form NCMR protocol.(network coding based multipath routing protocol).This protocol is used to obtain energy efficient wireless sensor network.. These protocol leads to decrease the number of constrain routes & the total time of transmission. This protocol is applied on unicast and multicast network separately. And comparison is done with traditional multipath routing protocol for same unicast and multicast network. Simulation result shows energy consumption of NCMR multicast is lower than NCMR unicast and also than TMR unicast as well as multicast. This work is proved by the simulation analysis results. The used multipath model is based on braided multipath routing, and the network coding method is random linear network coding (practical network coding). In braided network multiple paths to the sink nodes are created for each source node, and the packets encoded at source nodes are transmitted through the braided multipath network model. Then, intermediate nodes re-encode these received packets and transfer these new packets to next cluster. Finally, the multiple sink nodes decode the packets received from different paths and recover the original data. Results of the analysis show that multicast NCMR provides more reliability. We compare multicast NCMR routing protocol with NCMR unicast & also with traditional multipath routing protocol for unicast and multicast networks, in terms of the packet loss, energy consumption, successful delivery ratio & end to end delay when a packet is transmitted Some special simulations are carried out specially for NCMR multicast i.e. effect of number of nodes on energy consumption, packet loss & end to end delay.
Ameliorate the performance using soft computing approaches in wireless networksIJECEIAES
Wireless sensor networks are an innovative and rapidly advanced network occupying the broad spectrum of wireless networks. It works on the principle of “use with less expense, effort and with more comfort.” In these networks, routing provides efficient and effective data transmission between different sources to access points using the clustering technique. This work addresses the low-energy adaptive clustering hierarchy (LEACH) protocol’s main backdrop of choosing head nodes based on a random value. In this, the soft computing methods are used, namely the fuzzy approach, to overcome this barrier in LEACH. Our approach’s primary goal is to extend the network lifetime with efficient energy consumption and by choosing the appropriate head node in each cluster based on the fuzzy parameters. The proposed clustering algorithm focused on two fuzzy inference structures, namely Mamdani and Sugeno fuzzy logic models in two scenarios, respectively. We compared our approach with four existing works, the conventional LEACH, LEACH using the fuzzy method, multicriteria cluster head delegation, and fuzzy-based energy efficient clustering approach (FEECA) in wireless sensor network. The proposed scenario based fuzzy LEACH protocol approaches are better than the four existing methods regarding stability, network survivability, and energy consumption.
The main aim of energy efficient routing is to
minimize the energy required to transmit or receive packets also
called as active communication energy. Inactive energy is the
energy which not only tries to reduce the energy consumed
when a mobile node stays idle but also listens to the wireless
medium for any possible communication requests from other
nodes. To conserve energy, many energy efficient routing
protocols have been proposed. Networks of small, inexpensive,
disposable, smart sensors are emerging as a new technology with
tremendous potential. Wireless sensor networks can be randomly
deployed inside or close to phenomenon to be monitored. The
advantage of these networks is the fact that they are selfconfiguring,
which means that a sensor network can be deployed
randomly on a battlefield, in a disaster area or in an inaccessible
area without the need for human intervention. The energy
supplies of nodes are not replenished or replaced and therefore
nodes only participate in the network for as long as they have
energy. This fact necessitates energy efficiency in the design of
every aspect of such nodes. Energy consumption in sensor nodes
occurs mainly due to computational processing and, to a greater
extent, communication. The routing protocol employed by these
sensor nodes can minimize the number of transmissions that
nodes make as well as the computational complexity of routing
path selection. It is therefore of critical importance that the
routing protocol be designed with energy efficiency in mind.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks
(MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can
operate without using focal access points, pre-existing infrastructures, or a centralized management point.
In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead
to various problems in the routing process such as increase of the overhead massages and inefficient
routing between nodes of network. A large variety of clustering methods have been developed for
establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having
significant impact on MANETs performance. The K-means algorithm is one of the effective clustering
methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption.
This paper proposed a new K-means clustering algorithm to find out optimal path from source node to
destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means
clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed
cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the
performance of routing process in Mobile ad-hoc networks.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
1. Energy Aware Design Methodologies for Application
Specific NoC
Naveen Choudhary, M. S. Gaur, V. Laxmi
Virendra Singh
Department of Computer Engineering
SERC
Malaviya National Institute of Technology
Indian Institute of Science
Jaipur, India
Bangalore, India
naveenc121@yahoo.com, gaurms@mnit.ac.in,
viren@serc.iisc.ernet.in
vlaxmi@mnit.ac.in
II. IRREGULAR NOC COMMUNICATION MODEL AND
Abstract— Network-on-Chip (NoC) has emerged as a solution ARCHITECTURE
for communication framework for high-performance nanoscale In the following paragraphs, communication model,
architecture. One important aspect, in addition to deadlock-free associated NoC architecture and routing function applicable for
routing, is low power consumption. In view of varied the customized Irregular NoC are described.
communication requirements, application specific SoC design is
increasingly important. Customized NoC architectures are more
suitable for a particular application, and do not necessarily
conform to regular topologies. In this work, a methodology using
the priori knowledge of the application’s communication
characteristic for the design of customized and energy optimized
irregular NoC is proposed.
Keywords- NP-hard; NoC; Optimization; SoC; Core Graph.
I. INTRODUCTION
Network-on-Chip [1, 2, 7] has been proposed as the
solution for the on-chip communication challenges of future Figure 1. Application specific communication model in NoC
SoC architectures. Early works [2, 13] in NoC favored the use
of standard topologies such as meshes, tori, k-ary n-cubes or fat A. Communication Model
trees under the assumption that the wires can be well structured Task graphs [9, 11] are generally used to model the
in such topologies. However most application specific SoCs behavior of complex multi-core SoC applications on an
are heterogeneous with each core having different size, abstract level. The tasks Ti is mapped to a set of IP cores vj,
functionality and communication requirements. Thus, standard which communicates through unidirectional point-to-point
topologies can have a structure that poorly matches the abstract channels. The generic communication model is shown
application traffic leading to large wiring complexity after in Figure 1 and related definitions are presented as follows.
floor-planning, as well as significant energy and area overhead.
Moreover, for most SoCs the system is designed with static (or Definition 1 Core Graph is a directed graph, G (V, E) with each
semi-static) mapping of tasks to processors and hardware cores vertex νi ∈ V representing an IP core and a directed edge ei,j ∈ E,
and hence the communication traffic characteristics of the SoC representing the communication between the cores νi and νj. The
are well characterized at design time. Therefore it is expected weight of the edge ei,j denoted by bi,j , represent the desired average
bandwidth requirement of the communication from νi and νj.
that networks with irregular topology tailored to the
applications requirements to have an edge over the networks Definition 2 NoC topology graph is a directed graph N (U, F) with
with regular topology. Application specific custom topology each vertex υi ∈ U representing a node/tile in the topology and a
mapping and design have been explored in [8, 9, 10, 19]. In directed edge fi,j ∈ F represents direct communication channel
this paper, two genetic algorithm based heuristics for the between vertices υi and υj. Weight of the edge fi,j denoted by Abi,j
design of customized energy efficient irregular NoC based on represents the available link/channel bandwidth across the edge fi,j.
the applied routing function are proposed. B. Chip Layout & NoC Energy Model
Irregular NoC communication model and architecture are Floorplanning can be done using non-slicing based
defined in Section II. The proposed energy efficient design floorplannners such as B*-Trees [12]. The energy model [9] for
methodologies for customized NoC are presented in Section III. the Network-on-Chip is defined as follows:
The Genetic Algorithm (GA) used in the proposed Ebit (t i , t j ) = n hops × Erbit + (n hops − 1) × Elbit
methodologies is described in section IV. Section V presents
some experimental results followed by a brief conclusion in Where Ebit(ti, tj) is the average dynamic energy consumption
Section VI. for sending one bit of data from tile ti to tile tj, nhops is the
978-1-4244-8971-8/10$26.00 c 2010 IEEE
2. number of routers the bit traverses from tile ti to tile tj, Erbit and genetic algorithm (refer section V). The routing tables of
Elbit are the energy consumed by router and link respectively routers in the discovered shortest energy path are marked with
for transporting one bit of data. tag shortest path. Lastly the proposed methodology uses the
modified Dijkstra’s algorithm [14] according to up*/down*
C. Routing in Irregular NoC (Left Right) rule for finding escape routing paths from each
The popular routing algorithms with irregular topologies node in the shortest energy path to the corresponding
such as up*/down* routing [5], Left-Right routing [6], L-turn destination in the generated NoC and tags them as up*/down*
routing [6] use the turn model [4] to avoid deadlock condition. (Left-Right). While taking routing decision the output channels
In this paper minimal (shortest) paths are used for tagged as shortest path are selected with higher priority and
communication and up*/down* or Left-Right routing function up*/down* (Left Right) tagged channels are selected only when
is used to provide deadlock free escape paths [3] to avoid no output channel corresponding to shortest path is free.
deadlock situation in the network.
B. Shortest Path First (SPF) Methodology
III. METHODOLOGIES FOR ENERGY EFFICIENT NOC SPF is similar to MSTF methodology with the exception
GENERATION that in SPF the topology generation is initiated by first finding
the shortest energy path and later the topology is extended by
constructing the MST. As in MSTF, a genetic algorithm is used
to find the optimized energy-efficient traffic characteristics
order of the application. Since in MSTF, MST is constructed
first, it is possible that a large number of links for a number of
nodes in the topology are the links pertaining to MST. As
maximum links emanating from a node is limited to ndmax, this
phenomenon can lead to increased value of hop count in the
shortest energy paths generated later leading to increased
communication energy. However the SPF overcomes this
drawback by creating the links pertaining to shortest energy
Figure 2. Network construction using proposed methodologies
path before the links pertaining to MST. As shortest energy
In this section, two GA based methodologies: minimum- paths in the topology are generated first in SPF and so there
spanning-tree-first (MSTF) and shortest-paths-first (SPF) for can be a possibility that not enough number of free ports are
the design of customized energy efficient NoC and available to construct the MST in the topology later. In such
corresponding routing tables for deadlock free communication case a minimum number of ports per node need to be reserved
are presented. The routing function is implemented as given by before finding the shortest energy paths. However experiments
Silla et al [3] with up*/down* and Left-Right routing for escape showed that if communication requirement are uniformly
paths. For both the methodologies the floorplan information distributed in the Core Graph then such problems are rare if
and Core Graph exhibiting traffic characteristics respectively any. Algorithm 1 briefly presents the proposed methodologies.
are taken as inputs (refer Figure 2). Floorplanning can be done Algorithm 1 : Energy aware application specific NoC generator
based on Manhattan distance using a floorplannners such as
Require :
B*-Trees [12] assuming over the cell routing [17]. In both the 1. Œ = Core Graph = {E edges (i.e. traffic characteristics), V vertices}
proposed methodologies the link length is not allowed to 2. V = {vi | vi is ith IP core}
exceed the maximum permitted channel length (emax) due to 3. E = {eij : vi → vj with weight bwij | vi (source), vj (destination) • V}
constraint of physical signaling delay. Moreover constraint on 4. NoC = {T (Topology), R (Set of routing tables), S (set of shortest path)}
maximum permitted node-degree (ndmax) prevents the algorithm 5. TC_Array = {Array of traffic characteristic (i.e. ordered set of E)}
6. ndmax = Maximum permitted node degree in the topology T
from instantiating slow routers with a large number of I/O- 7. emax = The maximum permitted length of a link(channel) in topology T
channels which would decrease the achievable clock frequency 8. Manhattan Distance = ∆= {dij | dij = |vi – vj|, vi, vj • V, dij < emax }
due to internal routing and scheduling delay of the router. 9. u = node with maximum communication in Œ
Ensure : Energy Aware NoC Topology for CG
A. Minimum Spanning Tree First (MSTF) Methodology Procedure Minimum-Spanning-Tree-First()
In this methodology, first while keeping the constraints on 1. NoCEA.T = Φ; NoCEA.R = Φ; NoCEA.S = Φ;
ndmax and emax a minimum spanning tree (MST) using 2. Γ = {MST rooted at u as per ∆ and constraints ndmax & emax }
3. NoCEA.T = NoCEA.T ∪ {Γ}
Manhattan distance as a metric is generated on the nodes of the 4. (NoCEA, TC_Array) = GeniticAlgo(NoCEA,Γ)
Core Graph. The node with maximum bandwidth requirement 5. for each path si • {NoCEA.S }
is assumed as the root of the constructed MST. This MST helps o N = {set of nodes in path si}
in classifying all the channels of the topology as “up” (“Left”) o for nj • N
or “down” (“Right”). While keeping the constraints on ndmax NoCEA.R =NOCEA. R ∪ {update routing tables in NOCEA. R
and emax, the topology is further extended by laying the shortest for nodes • V in the root followed by the shortest up*/down*
energy path for each traffic characteristics. Due to constraints (Left–Right) escape path from node nj to the destination node
of path si. The routing table entry type tag is set as up*/down*
on ndmax and emax, the order in which such shortest energy paths (Lef –Right) for these nodes}
are generated basically decides the total communication energy o Endfor
requirement of the generated topology. The optimized order of 7. endfor
traffic characteristics of the application is found using a Endprocedure
Procedure Shortest-Paths-First( )
3. 1. NoCEA.T = Φ; NoCEA.R = Φ; NoCEA.S = Φ; Γ = Φ ; A. SPF and MSTF with Random Benchmarks
2. (NoCEA, TC_Array) = GeniticAlgo(NoCEA,Γ)
3. Γ = { MST rooted at u as per ∆ and constraints ndmax & emax } Performance of the proposed SPF and MSTF methodology
4. NoCEA.T = NoCEA.T ∪ {Γ} were compared on the IrNIRGAM with varying packet
5. for each path si • {NoCEA.S } injection interval. Figure 3 shows performance results averaged
o N = {set of nodes in path si} over 50 generated energy efficient irregular topologies
o for nj • N generated based on up*/down* routing function. Constraints of
NoCEA.R =NOCEA. R ∪ {update routing tables in NOCEA. R ndmax = 4 and emax as 1.5 times the maximum length of the
for nodes • V in the root followed by the shortest up*/down*
core/node among all the cores in the NoC were observed. For
(Left–Right) escape path from node nj to the destination node
of path si. The routing table entry type tag is set as up*/down* the SPF, total dynamic communication energy consumption
(Lef –Right) for these nodes} was on average 18.5% lesser in comparison to MSTF
o endfor Methodology. Moreover reduction in latency ( in the range of
8. endfor 7.5 clocks to 10 clocks) was observed for comparatively
Endprocedure similar throughput.
IV. GENETIC ALGORITHM
A genetic algorithm [15] based heuristic is used to find the
best order of the traffic characteristics to generate the shortest
energy paths in topology such that the communication energy
requirement of the application is optimized. In the proposed
genetic algorithm formulation each chromosome is represented
as an array of genes with each gene representing a traffic
characteristic for the application. 500 chromosomes are taken
in the initial population and crossover and mutation are done
on 50% and 40% of the population in each generation. (a)
Crossover is achieved by intermixing of the traffic
characteristics of two chromosomes whereas mutation is
performed by randomly changing the order of traffic
characteristic in a chromosome. Fitness of chromosome is
regarded as high if its cost approaches 0. The fitness function
used is as follows.
Cost = Eci / X
Where X is maximum chromosome energy requirement,
Eci is the energy requirement for chromosome ci. It may be
noted that, the best 10% chromosomes (referred as Best Class) (b)
in any generation are directly transferred to the next generation, Figure 3. Performance comparison with varying packet injection interval of
so as not to degrade the solution between the generations. (a) dynamic communication energy consumption (in pico joules) and (b)
Average flit latency (in clock cycles) of the proposed MSTF and SPF
V. EXPERIMENTAL RESULTS methodology averaged over 50 generated energy efficient irregular topologies
with number of cores varying from 16 to 81
Multiple Core Graphs using TGFF [11] were randomly
generated with diverse bandwidth requirement of the IP Cores.
B. SPF and Regular NoC with Random Benchmarks
Moreover a NoC simulator IrNIRGAM, extended version of
NIRGAM [16] supporting irregular topology with the provision Figure 4 shows the performance comparison SPF with 2D-
of supporting escape path routing for avoiding deadlock Mesh for equivalent sized tile and according to the application's
condition was deployed for performance evaluation. traffic characteristics requirement. ndmax = 4 and emax was
IrNIRGAM was run for 10000 clock cycles with applied packet taken as 2 times the length of the core/node. The SPF with
injection interval to evaluate the network performance with up*/down* (Left-Right) routing shows reduced average flit
varying traffic load. The router energy consumption is latency in the range of 10 (9.4) clocks to 20.9 (18.4) clocks and
evaluated using the power simulator orion [18] for 0.18µm 13.8 (13.2) clocks to 76 (69) clocks and reduction in average
technology. Similarly the dynamic bit energy consumption for per flit communication energy in the range of 18.8 (18.5%) to
inter-node links (Elbit) can be calculated using the equation: 29.2 (25.8%) and 25.2 (24.6%) to 54.7 (53%) in comparison to
2D-Mesh with XY and OE routing respectively for up*/down*
Elbit = (1 / 2) × α × C phy × VDD
2
(Left-Right) routing. In most cases SPF with up*/down*
routing was found to perform better.
Where α = average probability of a 1 to 0 or 0 to 1
transition between two successive samples in the stream for a C. SPF and Regular NoC with Intelligent Mapping
specific bit, α = 0.5 assuming data stream to be purely random, The proposed SPF methodology was compared with the
Cphy = physical capacitance of inter-node wire and VDD is the intelligent energy aware mapping technique proposed in [9] for
supply voltage. equivalent tile sizes and application to core mapping. Figure 5
shows reduction in average flit latency in the range of 1.7
4. clocks to 5 clocks and 7.5 clocks to 20.4 clocks and reduction for deadlock prevention, the presented methodologies can be
in average per flit communication energy in the range of 1.6% adapted with any topology agnostic routing algorithms where
to 10.9% and 17% to 37% for SPF methodology for equivalent generic routing rules based on turn prohibition can be laid. It
throughput in comparison to the 2D-Mesh with XY and OE is believed that the combined treatment of the routing and
routing respectively. topology generation offers a huge potential of optimization for
future application-specific NoC architectures.
REFERENCES
[1] W. J. Dally, B.Towles,,“Route Packets, Not Wires: On-Chip
Interconnection Networks,” in IEEE Proceedings of the 38th Design
Automation Conference (DAC), pp. 684–689, 2001.
[2] S. Kumar, A. Jantsch, J.-P. Soininen, M. Forsell, M. Millberg, J.
Oberg, K. Tiensyrja, and A. Hemani, “A Network on Chip Architecture
and Design Methodology”, In Proceedings of VLSI Annual Symposium
(a) Average per flit latency and throughput (in flits) (ISVLSI 2002), pp. 105–112, 2002.
[3] F. Silla, J. Duato, “ High-Performance Routing in Networks of
Workstations with Irregular Topology,” in IEEE Transactions on
Parallel and Distributed Systems, vol. 11, pp. 699-719, july 2000.
[4] C. Glass, L. Ni, “The Turn Model for Adaptive Routing”. In Proceeding
of 19th International Symposium on Computer Architecture. pp. 278–
287, May 1992.
[5] M. D. Schroeder et al., “Autonet: A High-Speed Self-Configuring Local
Area Network Using Point-to-Point Links”. Journal on Selected Areas
in Communications, 9, 1991.
[6] A. Jouraku, A. Funahashi, H. Amano, M. Koibuchi, “L-turn routing: An
(b) Average communication energy per flit Adaptive Routing in Irregular Networks”. In Proceeding of the
Figure 4. SPF (up*/down* & Left-Right routing) performance comparison International Conference on Parallel Processing, pp. 374-383, Sep.
with 2D-Mesh (XY & OE routing) averaged over 50 generated energy 2001.
efficient irregular topologies with number of cores varying from 16 to 81 (a) [7] U. Ogras, J. Hu, R. Marculescu, “Key research problems in NoC design:
Average flit latency (in clock cycles) and (b) Average communication energy a holistic perspective”. In IEEE CODES+ISSS, pp. 69-74, 2005.
consumption per flit (in pico joules) [8] S. Murali, G. De Micheli, “SUNMAP: A Tool for Automatic Topology
Selection and Generation for NoCs”. In Proceeding of DAC, 2004.
[9] J. Hu, R. Marculescu, “Energy-Aware Mapping for Tile-based NOC
Architectures Under Performance Constraints”. In ASP-DAC 2003, Jan
2003.
[10] J. Hu, R. Marculescu, “Energy- and performance-aware mapping for
regular NoC architectures”. In IEEE Trans. on CAD of Integrated
Circuits and Systems, 24(4), April 2005.
[11] R. P. Dick, D. L. Rhodes, W. Wolf, “TGFF: task graphs for free”. In
Proceeding of the International Workshop on Hardware/Software
Codesign, March 1998.
[12] Y. C. Chang, Y. W. Chang, G. M. Wu, S. W. Wu, “B*-Trees : A New
(a) Average per flit latency and Throughput (in flits) Representation for Non-Slicing Floorplans”. In Proceeding of 37th
Design Automation Conference, pp. 458-463, 2000.
[13] L. Natvig, “High-level Architectural Simulation of the Torus Routing
Chip”. In Proceedings of the International Verilog HDL Conference,
California, pp. 48–55, Mar. 1997.
[14] T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, Prentice
Hall International, 1990.
[15] A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing,
Springer-Verlag, Berlin, Heidelberg, 2003.
[16] L. Jain, B. M. Al-Hashimi, M. S. Gaur, V. Laxmi, A. Narayanan,
(b) Average communication energy per flit “NIRGAM: A Simulator for NoC Interconnect Routing and Application
Figure 5. SPF and 2D-Mesh performance comparison for intelligent Modelling”. DATE 2007, 2007.
application to Core mapping averaged over 50 generated energy efficient [17] K. Srinivasan, K. S. Chatha, “Layout Aware Design of Mesh based NoC
irregular topologies with number of cores varying from 16 to 81 (a) Average Architectures”. In Proceedings of 4th International Conference on
flit latency (in clock cycles) and (b) Average communication energy Hardware Software Codesign and System Synthesis, Seoul, Korea, pp.
consumption per flit (in pico joules) 136-141, 2006.
[18] H-S Wang et al., “Orion: A Power-Performance Simulator for
VI. CONCLUSION AND FUTURE WORK Interconnection Network,” in Proc. International Symposium on
Microarchitecture, Nov 2002.
[19] K. Srinivasan et al., “An Automated Technique for Topology and Route
In this paper, the energy efficient customized Irregular Generation of Application Specific On-Chip Interconnection Networks,”
topology generation problem for NoC was addressed. in Proc. ICCAD 2005.
Although in this paper for the proposed methodologies,
up*/down* and Left-Right routing were used as escape path