The shortcomings of conventional bus architectures are in terms of scalability and the ever increasing
demand of more bandwidth. And also the feature size of sub-micron domain is decreasing making it
difficult for bus architectures to fulfill the requirements of modern System on Chip (SoC) systems. Network
on chip (NoC) architectures presents a solution to the earlier mentioned shortcomings by employing a
packet based network for inter IP communications. A pivotal feature of NoC systems is the topology in
which the system is arranged. Several parameters which are topology dependent like hop count, path
diversity, degree and other various parameters affect the system performance. We propose a novel
topology forNoC architecture which has been thoroughly compared with the existing topologies on the
basis of different network parameters.
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the
process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other
group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network
lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their
advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I
summarize and conclude the paper with some future directions
TERNARY TREE ASYNCHRONOUS INTERCONNECT NETWORK FOR GALS’ SOCVLSICS Design
Interconnect fabric requires easy integration of computational block operating with unrelated clocks. This paper presents asynchronous interconnect with ternary tree asynchronous network for Globally Asynchronous Locally Synchronous (GALS) system-on-chip (SOC). Here architecture is proposed for interconnection with ternary tree asynchronous network where ratio of number NOC design unit and number of router is 4:1,6:2, 8:3,10:4 etc .It is scalable for any number of NOC design unit. It offers an easy integration of different clock domain with low communication overhead .NOC design unit for GALS ‘SOC is formulated by wrapping synchronous module with input port along with input port controller, output port along with output port controller and local clock generator. It creates the interface between synchronous to asynchronous and asynchronous to synchronous. For this purpose four port asynchronous routers is designed with routing element and output arbitration and buffering with micro-pipeline. This interconnect fabric minimizes silicon area, minimize Latency and maximize throughput. Here functional model is made for TTAN and application MPEG4 is mapped on the Network .Desired traffic pattern is generated and performance of the network is evaluated. Significant improvement in the network performance parameter has been observed.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
this paper they introduced UWMAC, a transmitter-based CDMA MAC protocol for UWASNs that integrates a new closed-loop distributed algorithm to establish the optimum transmit power and code length to decrease the near-far impact. UW-MAC objective is to obtain three goals i.e. low channel access delay, high network throughput and low energy consumption. It is shown that UW-MAC maintains to simultaneously obtain limited channel access delay, high network throughput and low energy consumption in deep water communications, which are not critically influenced by multipath. Fatma Bouabdallah and Raouf Boutaba suggested UW-OFDMAC, a distributed Medium Access Control (MAC) protocol which
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the
process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other
group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network
lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their
advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I
summarize and conclude the paper with some future directions
TERNARY TREE ASYNCHRONOUS INTERCONNECT NETWORK FOR GALS’ SOCVLSICS Design
Interconnect fabric requires easy integration of computational block operating with unrelated clocks. This paper presents asynchronous interconnect with ternary tree asynchronous network for Globally Asynchronous Locally Synchronous (GALS) system-on-chip (SOC). Here architecture is proposed for interconnection with ternary tree asynchronous network where ratio of number NOC design unit and number of router is 4:1,6:2, 8:3,10:4 etc .It is scalable for any number of NOC design unit. It offers an easy integration of different clock domain with low communication overhead .NOC design unit for GALS ‘SOC is formulated by wrapping synchronous module with input port along with input port controller, output port along with output port controller and local clock generator. It creates the interface between synchronous to asynchronous and asynchronous to synchronous. For this purpose four port asynchronous routers is designed with routing element and output arbitration and buffering with micro-pipeline. This interconnect fabric minimizes silicon area, minimize Latency and maximize throughput. Here functional model is made for TTAN and application MPEG4 is mapped on the Network .Desired traffic pattern is generated and performance of the network is evaluated. Significant improvement in the network performance parameter has been observed.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
this paper they introduced UWMAC, a transmitter-based CDMA MAC protocol for UWASNs that integrates a new closed-loop distributed algorithm to establish the optimum transmit power and code length to decrease the near-far impact. UW-MAC objective is to obtain three goals i.e. low channel access delay, high network throughput and low energy consumption. It is shown that UW-MAC maintains to simultaneously obtain limited channel access delay, high network throughput and low energy consumption in deep water communications, which are not critically influenced by multipath. Fatma Bouabdallah and Raouf Boutaba suggested UW-OFDMAC, a distributed Medium Access Control (MAC) protocol which
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
Abstract The aim of this paper is to investigate the transmission of data between client and server through different IEEE 802.11 wireless LAN multi- HOP network. To improve this issue, the transmission opportunity (TXOP) mechanism is defined in the IEEE 802.11e standard, with which a wireless node can transmit multiple frames consecutively for a maximum channel occupancy time, called TXOP limit. This paper considers the performance of the TXOP mechanism for multi-hop wireless networks. Focusing on a three-node chain topology, we model it as a tandem queuing network with two nodes. The E2ET is derived and the analysis is validated by simulation. Numerical results show that the TXOP mechanism works well for multi-hop wireless networks. It is also shown that adjusting TXOP limit is significantly important in order to increase the overall throughput. In terms of multi-hop wireless networks, there is little analytical work with regard to the E2ET performance. One of the rationales for the analytical difficulty for multi-hop wireless networks is that IEEE 802.11 MAC protocol is too complex to model the behavior of multi-hop frame transmissions. Keywords: IEEE 802.11e, multi-hop wireless LAN, TXOP, E2ET
This topic is related to computer network in these topic How the computers are communicate each other through the different connections and the data transfer between them.The adavantages and disadvantages of these topologies..
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
PERFORMANCE COMPARISON AND ANALYSIS OF PROACTIVE, REACTIVE AND HYBRID ROUTING...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols
have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated
using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
ETX METRIC FOR EXTREMELY OPPORTUNISTIC ROUTING TO IMPROVE THE PERFORMANCE OF ...ijasuc
Mobility in wireless networks has paved way for a new paradigm of communication in this era. Exploiting
the optimal routing technique for hybrid wireless networks which brings in a balance of the overheads in
infrastructure based and infrastructure less network is essential. Routing protocol design for hybrid
wireless network is critical in order to improve the performance and reliability of the network.
Opportunistic Routing (OR) technique attempts to deal with unreliable transmissions by utilizing the
broadcast nature of the wireless medium. Due to multi-hop nature of ad hoc networks, Opportunistic
Routing provides lesser throughput than expected when minimum hop count metric is used. To combat the
above limitations, an Extremely Opportunistic Routing(ExOR) scheme with Expected Transmission
count(ETX) metric is proposed and implemented in a hybrid scenario. The simulation study reveals that
this routing technique efficiently utilizes resources and improves the end-to-end throughput and packet
delivery ratio in hybrid wireless networks.
A MASS BALANCING THEOREM FOR THE ECONOMICAL NETWORK FLOW MAXIMISATIONIJCNCJournal
A mass balancing theorem (MBT) was recently introduced, concerning the role of 'unbalanced nodes' in the optimization of network flow. The MBT discovers and proves a flow-balancing property, which can be exploited in the design of network flow algorithms. Subsequently a number of such applications of the MBT have been explored for various types of flow-networks. These have included, in particular, single and
multiple commodity networks with additional equipment of separators, which are present in various real world scenarios including the oil and gas industry. In this paper, the mass balancing theorem is revisited,and further developed to consider new network examples with embedded cycles. In doing so, algorithms based on the mass balancing method are extended to remove any undesirably saturated edges in the
network, consequently reducing economic costs for flow-maximization in such networks.
Impact of network quality deterioration on user’s perceived operability and l...IJCNCJournal
The remote desktop environment (Virtual Desktop Infrastructure) is attracting interest as a way to
strengthen security and support mobile access ortelework. To realize the remote desktop environments, a remote desktop protocol is required to transfer information via a network about the user’s operations made on the keyboard and mouse on a terminal to the remote server. The growing popularity of remote desktop environments makes it important to determine the factors that govern the user’s perceived operability with a remote desktop protocol. It is also necessary important to find out the conditions for a wide- area live migration of virtual machines, to use resources efficiently in the remote desktop environments.
This paper examines the impact of network quality deterioration (long network delay, high packet loss,
small downlink bandwidth) on a user’s perceived operability in remote desktop environments, assuming
RDP, PCoIP and ICA as remote desktop protocol. Next, this paper studies the impact of network quality on
the performance of a live-migration of virtual machines in remote desktop environments.
The article looks into the current state of the art of dynamic routing protocols with respect to their
possibilities to react to changes in the Quality of Service when selecting the best route towards a
destination network. New options that could leverage information about the ever changing QoS parameters
for data communication are analysed and a Cisco Performance Routing solution is described more in
detail. The practical part of this work focuses on a design and implementation of a test bed that provides a
scalable laboratory architecture to manipulate QoS parameters of different data communications flowing
through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing
optimization capabilities in different scenarios.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Extending network lifetime of wireless sensorIJCNCJournal
One critical issue in designing and managing a wireless sensor network is how to save the energy consumption
of the sensors in order to maximize network lifetime under the constraint of full coverage of the monitored
targets. In this paper, we adopt the common approach of creating disjoint sensor covers to prolong network
lifetime. The typical goal used in the literature is to maximize the number of covers without consideration of
the energy levels of the sensors. We argue that the network lifetime can be extended by maximizing the total
bottleneck energy of the created covers. We formally define the problem of maximizing the total bottleneck
energy of the covers, present for the first time an integer programming formulation of the problem, and develop
two algorithms to solve large problem instances. Extensive experimental tests show that the use of the goal of
maximizing the total bottleneck energy of the covers creates covers with substantially longer network lifetime
than the lifetime of the covers created with the goal of maximizing solely the number of covers.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
Abstract The aim of this paper is to investigate the transmission of data between client and server through different IEEE 802.11 wireless LAN multi- HOP network. To improve this issue, the transmission opportunity (TXOP) mechanism is defined in the IEEE 802.11e standard, with which a wireless node can transmit multiple frames consecutively for a maximum channel occupancy time, called TXOP limit. This paper considers the performance of the TXOP mechanism for multi-hop wireless networks. Focusing on a three-node chain topology, we model it as a tandem queuing network with two nodes. The E2ET is derived and the analysis is validated by simulation. Numerical results show that the TXOP mechanism works well for multi-hop wireless networks. It is also shown that adjusting TXOP limit is significantly important in order to increase the overall throughput. In terms of multi-hop wireless networks, there is little analytical work with regard to the E2ET performance. One of the rationales for the analytical difficulty for multi-hop wireless networks is that IEEE 802.11 MAC protocol is too complex to model the behavior of multi-hop frame transmissions. Keywords: IEEE 802.11e, multi-hop wireless LAN, TXOP, E2ET
This topic is related to computer network in these topic How the computers are communicate each other through the different connections and the data transfer between them.The adavantages and disadvantages of these topologies..
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
PERFORMANCE COMPARISON AND ANALYSIS OF PROACTIVE, REACTIVE AND HYBRID ROUTING...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols
have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated
using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
ETX METRIC FOR EXTREMELY OPPORTUNISTIC ROUTING TO IMPROVE THE PERFORMANCE OF ...ijasuc
Mobility in wireless networks has paved way for a new paradigm of communication in this era. Exploiting
the optimal routing technique for hybrid wireless networks which brings in a balance of the overheads in
infrastructure based and infrastructure less network is essential. Routing protocol design for hybrid
wireless network is critical in order to improve the performance and reliability of the network.
Opportunistic Routing (OR) technique attempts to deal with unreliable transmissions by utilizing the
broadcast nature of the wireless medium. Due to multi-hop nature of ad hoc networks, Opportunistic
Routing provides lesser throughput than expected when minimum hop count metric is used. To combat the
above limitations, an Extremely Opportunistic Routing(ExOR) scheme with Expected Transmission
count(ETX) metric is proposed and implemented in a hybrid scenario. The simulation study reveals that
this routing technique efficiently utilizes resources and improves the end-to-end throughput and packet
delivery ratio in hybrid wireless networks.
A MASS BALANCING THEOREM FOR THE ECONOMICAL NETWORK FLOW MAXIMISATIONIJCNCJournal
A mass balancing theorem (MBT) was recently introduced, concerning the role of 'unbalanced nodes' in the optimization of network flow. The MBT discovers and proves a flow-balancing property, which can be exploited in the design of network flow algorithms. Subsequently a number of such applications of the MBT have been explored for various types of flow-networks. These have included, in particular, single and
multiple commodity networks with additional equipment of separators, which are present in various real world scenarios including the oil and gas industry. In this paper, the mass balancing theorem is revisited,and further developed to consider new network examples with embedded cycles. In doing so, algorithms based on the mass balancing method are extended to remove any undesirably saturated edges in the
network, consequently reducing economic costs for flow-maximization in such networks.
Impact of network quality deterioration on user’s perceived operability and l...IJCNCJournal
The remote desktop environment (Virtual Desktop Infrastructure) is attracting interest as a way to
strengthen security and support mobile access ortelework. To realize the remote desktop environments, a remote desktop protocol is required to transfer information via a network about the user’s operations made on the keyboard and mouse on a terminal to the remote server. The growing popularity of remote desktop environments makes it important to determine the factors that govern the user’s perceived operability with a remote desktop protocol. It is also necessary important to find out the conditions for a wide- area live migration of virtual machines, to use resources efficiently in the remote desktop environments.
This paper examines the impact of network quality deterioration (long network delay, high packet loss,
small downlink bandwidth) on a user’s perceived operability in remote desktop environments, assuming
RDP, PCoIP and ICA as remote desktop protocol. Next, this paper studies the impact of network quality on
the performance of a live-migration of virtual machines in remote desktop environments.
The article looks into the current state of the art of dynamic routing protocols with respect to their
possibilities to react to changes in the Quality of Service when selecting the best route towards a
destination network. New options that could leverage information about the ever changing QoS parameters
for data communication are analysed and a Cisco Performance Routing solution is described more in
detail. The practical part of this work focuses on a design and implementation of a test bed that provides a
scalable laboratory architecture to manipulate QoS parameters of different data communications flowing
through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing
optimization capabilities in different scenarios.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Extending network lifetime of wireless sensorIJCNCJournal
One critical issue in designing and managing a wireless sensor network is how to save the energy consumption
of the sensors in order to maximize network lifetime under the constraint of full coverage of the monitored
targets. In this paper, we adopt the common approach of creating disjoint sensor covers to prolong network
lifetime. The typical goal used in the literature is to maximize the number of covers without consideration of
the energy levels of the sensors. We argue that the network lifetime can be extended by maximizing the total
bottleneck energy of the created covers. We formally define the problem of maximizing the total bottleneck
energy of the covers, present for the first time an integer programming formulation of the problem, and develop
two algorithms to solve large problem instances. Extensive experimental tests show that the use of the goal of
maximizing the total bottleneck energy of the covers creates covers with substantially longer network lifetime
than the lifetime of the covers created with the goal of maximizing solely the number of covers.
MODELING AND DESIGNING RESOURCE EFFICIENT DISTRIBUTED MANET MANAGEMENT SYSTEM...IJCNCJournal
Traditional network management systems use spoofing of resources to collect statistical data such as resource usage and performance. This data is exchanged with other resources through management protocols. The amount of data can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for
management functions increases and become inefficient as it increases the power usage for processing. In
this paper, we propose a distributed network management system where each network resource maintains a
set of Management Information Base (MIB) elements and stores resource activities in their abstraction in
terms of counters, flag and threshold values. The abstract data is exchanged between different management
agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. Our proposed architecture can be implemented in any network, but is highly important to be considered in power and bandwidth constrained networks such as Mobile Ad Hoc Networks (MANET). In this research, we use cross layer models to demonstrate simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for multi-service applications.
Correlating objective factors with videoIJCNCJournal
To succeed in providing services, the quality of services should meet users’ satisfaction. This is a motivation to study the relationship between the service quality and the real perceived quality of users, which is commonly referred to as the quality of experience (QoE). However, most of existing QoE studies that focus on video-on-demand or IPTV services analyze only the influence of network behaviors to video quality. This paper focuses on P2P video streaming services, which are becoming a significant portion of Internet traffic, and pays attention to the change of users’ perception with the adjustment of objective
factors as well as network behaviors. We propose to use mean opinion score and peak signal to noise ratio
methods as QoE evaluations to consider the effect of the chunk loss ratio, the group-of-picture size, and the
chunk size. The experimental results provide a convincing reference to build the complete relationship
between objective factors and QoE. We believe that this assessment will contribute to study a new service
quality evaluation mechanism based on users’ satisfaction in the future.
HANDOVER OPTIMIZATION BASED ON MEDIA INDEPENDENT HANDOVER IN NEW NETWORKS NGWN IJCNCJournal
One of the challenging issues in Next Generation Wireless Network (NGWN) is achieving seamless Vertical
Handover (VHO) while roaming between different technologies such as Wireless Fidelity (Wi- Fi),
Worldwide Interoperability for Microwave Access (WiMAX), Universal Mobile Telecommunications
System (UMTS) and Long Term Evolution (LTE). F or that the telecommunication operators will be
required to develop a strategy for interoperability of these different types of existing network to give the
best connection anywhere anytime for the Mobile Users (MUs).
To full these requirements we propose a new VHO approach that based on loose coupling internetworking
in conjunction with Mobile IPv4 ( MIPv4) under Media Independent Handover (MIH). Our objective is
develop a strategy for interoperability of different technologies and optimized the VHO decision. Our
proposed approach provides more exhaustive, high accurate and better performance compared with the
approaches proposed in the literature.
GPS SYSTEMS LITERATURE: INACCURACY FACTORS AND EFFECTIVE SOLUTIONS IJCNCJournal
Today, Global Positioning System (GPS) is widely used in almost every aspect of our daily life. Commonly,
users utilize the technology to track the position of a vehicle or an object of interest. They also use it to
safely navigate to the destination of their choice. As a result, there are countless number of GPS based
tracking application that has been developed. But, a main recurring issue that exists among these
applications are the inaccuracy of the tracking faced by users and this issue has become a rising concern.
Most existing research have examined the effects that the inaccuracy of GPS have on users while others
identified suitable methods to improve the accuracy of GPS based on one or two factors. The objective of
this survey paper is to identify the common factors that affects the accuracy of GPS and identify an effective
method which could mitigate or overcome most of those factors. As part of our research, we conducted a
thorough examination of the existing factors for GPS inaccuracies. According to an initial survey that we
have collected, most of the respondents has faced some form of GPS inaccuracy. Among the common issues
faced are inaccurate object tracking and disconnection of GPS signal while using an application. As such,
most of the respondents agree that it is necessary to improve the accuracy of GPS. This leads to another
objective of this paper, which is to examine and evaluate existing methods as well as to identify the most
effective method that could improve the accuracy of GPS.
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS S...IJCNCJournal
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets
are the essential operations for finding the path between two ends. In such situations, intermediate node
which may or may not belongs will participate in route discovery process, update routing table and
rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with
minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed
Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions in
route discover process. The algorithm is an improved version of SARA and has features extracted from
petal routing. The algorithm is simulated on NS2, compared with ACO frame work called SARA and
classical routing protocols such as AODV and AOMDV. The simulation results shows that PAR further
reduces overhead by eliminating redundant FANT transmission compared to other routing algorithm.
PERFORMANCE EVALUATION OF MOBILE WIMAX IEEE 802.16E FOR HARD HANDOVERIJCNCJournal
Seamless handover in wireless networks is to guarantee both service continuity and service quality. In
WiMAX, providing scalability and quality of service for multimedia services during handover is a main
challenge because of high latency and packet loss. In this paper, we created four scenarios using Qualnet
5.2 Network Simulator to analyze the hard handover functionality of WiMAX under different conditions.
The scenarios such as Flag with 5 and 10 sec UCD and DCD interval values, Random mobility scenario
and DEM scenario using 6 WiMAX Cells have been considered. This study is performed over the real
urban area of JNU where we have used JNU map for scenarios 1, 2 and 3 but for scenario 4, the JNU
terrain data has been used. Further, each BS of 6 WiMAX cell is connected to four nodes. All nodes of each
scenario are fixed except Node 1. Node 1 is moving and performing the handover between the different BSs
while sending and receiving real time traffics. Flag mobility model is used in Scenario 1, 2 and 4 to model
the movement of the Node 1 while we use random mobility model in sceanrio3. 5 seconds time interval is
used for Scenarios 1, 3, and 4 while 10 seconds time interval is used for scenario 2 to study the effect of
management messages load on handover. Further, the statistical measures of handover performance of
WiMAX in terms of number of handover performed, throughput, end-to-end delay, jitter, and packets
dropped are observed and evaluated.
MODELING, IMPLEMENTATION AND PERFORMANCE ANALYSIS OF MOBILITY LOAD BALANCING ...IJCNCJournal
We propose in this paper a simulation implementation of Self-Organizing Networks (SON) optimization
related to mobility load balancing (MLB) for LTE systems using ns-3 [1]. The implementation is achieved
toward two MLB algorithms dynamically adjusting handover (HO) parameters based on the Reference
Signal Received Power (RSRP) measurements. Such adjustments are done with respect to loads of both an
overloaded cell and its cells’ neighbours having enough available resources enabling to achieve load
balancing. Numerical investigations through selected key performance indicators (KPIs) of the proposed
MLB algorithms when compared with another HO algorithm (already implemented in ns-3) based on A3
event [2] highlight the significant MLB gains provided in terms global network throughput, packet loss rate
and the number of successful HO without incurring significant overhead.
Privacy, especially in a cellphone, is an important thing and should be protected. Steganography is a
method used to protect a sensitive information. The issue tried to be discussed in this study is the issue on
inserting technique in a text through a simple method of White Space Steganography on android. The
inserted message has been compressed through a double compression method by using LZW and Huffman
so that the size of message to be inserted can be minimized while the capacity of the inserted message can
be minimized. The compression shows that the compression ratio much depends on the type of text input to
the text to be sent; the more the repetition or duplication found on the message, the smaller the
compression ratio will be. The compression process using Android based smartphone is relatively fast with
the average duration of 0.045 seconds, either for the insertion or extraction.
One of the most attractive field for research for researchers and authors so the Wireless adhoc networks.
So, this paper will describe the background and basic features of Open Short Path First (OSPF) routing
protocol due to multi-access networks. Explaining and practice on the OSPF configuration commands.
Describe, modify and calculate the metric (Cost) used by OSPF due to adhoc networks. Illustrating the
Election parameters made by DR/BDR (Designated and Back Designated) Routers used in multi-access
wireless networks. This paper will use OSPF routing protocol because of its average administrative
distance with all routing protocols.
A genetic algorithm for constructing broadcast trees with cost and delay cons...IJCNCJournal
We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the connection matrix of the given network to find the spanning trees and considers the weights of the links to obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The scalability and the performance of the algorithm with increasing number of network nodes are also encouraging.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
A MIDDLEWARE FOR THE INTERNET OF THINGSIJCNCJournal
The Internet of Things (IoT) connects everyday objects including a vast array of sensors, actuators, and smart devices, referred to as “things” to the Internet, in an intelligent and pervasive fashion. This connectivity gives rise to the possibility of using the tracking capabilities of things to impinge on the location privacy of users. Most of the existing management and location privacy protection solutions do not consider the low-cost and low-power requirements of things; or, they do not account for the heterogeneity, scalability, or autonomy of communications supported in the IoT. Moreover, these traditional solutions do not consider the case where a user wishes to control the granularity of the disclosed information based on
the context of their use (e.g. based on the time or the current location of the user). To fill this gap, a middleware, referred to as the Internet of Things Management Platform (IoT-MP) is proposed in this paper.
Network on Chip Architecture and Routing Techniques: A surveyIJRES Journal
The processor designing and development was designed to perform various complex logical information exchange and processing operations in a variety of resolutions. They mainly rely on concurrent and sync, both that of the software and hardware to enhance the productivity and performance. With the high speed growth approaching multi-billion transistor integration era, some of the main problems which are symbolized by all gate lengths in the range of 60-90 nm, will be from non-scalable delays generated by wire. All similar problems may be solved by using Network on Chip (NOC) systems. In the presented paper, we have summarized research papers and contributions in NOC area. With advancement in the technology in the on chip communication, faster interaction between devices is becoming vital. Network on Chip (NOC) can be one of the solutions for faster on chip communication. For efficient link between devices of NOC, routers are needed. This paper also reviews implementation of routing techniques. The use of routing gives higher throughput as required for dealing with complexity of modern systems. It is mainly focused on the routing design parameters on both system level including traffic pattern, network topology and routing algorithm, and architecture level including arbitration algorithm.
Topology Design of Extended Torus and Ring for Low Latency Network-on-Chip Ar...TELKOMNIKA JOURNAL
In essence, Network-on-Chip (NoC) also known as on-chip interconnection network has been
proposed as a design solution to System-on-Chip (SoC). The routing algorithm, topology and switching
technique are significant because of the most influential effect on the overall performance of Network-on-
Chip (NoC). Designing of large scale topology alongside the support of deadlock free, low latency, high
throughput and low power consumption is notably challenging in particular with expanding network size.
This paper proposed an 8x8 XX-Torus and 64 nodes XX-Ring topology schemes for Network-on-Chip to
minimize the latency by decrease the node diameter from the source node to destination node.
Correspondingly, we compare in differences on the performance of mesh, full-mesh, torus and ring
topologies with XX-Torus and XX-Ring topologies in term of latency. Results show that XX-Ring
outperforms the conventional topologies in term of latency. XX-Ring decreases the average latency by
106.28%, 14.80%, 6.7 1%, 1.73%, 442.24% over the mesh, fully-mesh, torus, XX-torus, and Ring
topologies.
Many intellectual property (IP) modules are present in contemporary system on chips (SoCs). This could provide an issue with interconnection among different IP modules, which would limit the system's ability to scale. Traditional bus-based SoC architectures have a connectivity bottleneck, and network on chip (NoC) has evolved as an embedded switching network to address this issue. The interconnections between various cores or IP modules on a chip have a significant impact on communication and chip performance in terms of power, area latency and throughput. Also, designing a reliable fault tolerant NoC became a significant concern. In fault tolerant NoC it becomes critical to identify faulty node and dynamically reroute the packets keeping minimum latency. This study provides an insight into a domain of NoC, with intention of understanding fault tolerant approach based on the XY routing algorithm for 4×4 mesh architecture. The fault tolerant NoC design is synthesized on field programmable gate array (FPGA).
Network-on-Chip (NoC) is a new approach for designing the communication subsystem among IP cores in a System-on-Chip (SoC). NoC applies networking theory and related methods to on-chip communication and brings out notable improvements over conventional bus and crossbar interconnections. NoC offers a great improvement over the issues like scalability, productivity, power efficiency and signal integrity challenges of complex SoC design. In an NoC, the communication among different nodes is achieved by routing packets through a pre-designed network fabric according to some routing algorithm. Therefore, architecture and related routing algorithm play an important role to the improvement of overall performance of an NoC. A Diametrical 2D Mesh routing architecture has the facility of having some additional diagonal links with simple 2D Mesh architecture. In this work, we have proposed a Modified Extended 2D routing algorithm for this architecture, which will ensure that a packet always reaches the destination through the possible shortest path, and the path is always deadlock free.
Noise Tolerant and Faster On Chip Communication Using Binoc ModelIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
Performance Analysis of Mesh-based NoC’s on Routing Algorithms IJECEIAES
The advent of System-on-Chip (SoCs), has brought about a need to increase the scale of multi-core chip networks. Bus Based communications have proved to be limited in terms of performance and ease of scalability, the solution to both bus – based and Point-to-Point (P2P) communication systems is to use a communication infrastructure called Network-on-Chip (NoC). Performance of NoC depends on various factors such as network topology, routing strategy and switching technique and traffic patterns. In this paper, we have taken the initiative to compile together a comparative analysis of different Network on Chip infrastructures based on the classification of routing algorithm, switching technique, and traffic patterns. The goal is to show how varied combinations of the three factors perform differently based on the size of the mesh network, using NOXIM, an open source SystemC Simulator of mesh-based NoC. The analysis has shown tenable evidence highlighting the novelty of XY routing algorithm.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A Flexible Software/Hardware Adaptive Network for Embedded Distributed Archit...csijjournal
Embedded platforms are projected to integrate hundreds of cores in the near future, and expanding the interconnection network remains a key challenge. We propose SNet, a new Scalable NETwork paradigm that extends the NoCs area to include a software/hardware dynamic routing mechanism. To design routing pathways among communicating processes, it uses a distributed, adaptive, non-supervised routing method based on the ACO algorithm (Ant Colony Optimization). A small footprint hardware unit called DMC speeds up data transfer (Direct Management of Communications). SNet has the benefit of being extremely versatile, allowing for the creation of a broad range of routing topologies to meet the needs of various applications. We provide the DMC module in this work and assess SNet performance by executing a large number of test cases.
A FLEXIBLE SOFTWARE/HARDWARE ADAPTIVE NETWORK FOR EMBEDDED DISTRIBUTED ARCHIT...csijjournal
Embedded platforms are projected to integrate hundreds of cores in the near future, and expanding the
interconnection network remains a key challenge. We propose SNet, a new Scalable NETwork paradigm
that extends the NoCs area to include a software/hardware dynamic routing mechanism. To design routing
pathways among communicating processes, it uses a distributed, adaptive, non-supervised routing method
based on the ACO algorithm (Ant Colony Optimization). A small footprint hardware unit called DMC
speeds up data transfer (Direct Management of Communications). SNet has the benefit of being extremely
versatile, allowing for the creation of a broad range of routing topologies to meet the needs of various
applications. We provide the DMC module in this work and assess SNet performance by executing a large
number of test cases.
Design of an Efficient Communication Protocol for 3d Interconnection NetworkIJMTST Journal
Three-dimensional integrated circuits (3D ICs) provide better device integration, reduced signal delay and reduced interconnect power. They additionally give better layout flexibility by permitting heterogeneous integration, by taking the advantage of intrinsic capability of reducing the wire length in 3D ICs, 3D NOC Bus Hybrid mesh layout was suggested. This layout provides an apparently significant stage to implement economical multicast routings for 3D networks-on-chip. A unique multicast partitioning and routing strategy for the 3D NOC-Bus Hybrid mesh architectures to improve the system performance and to decrease the power consumption is being proposed. The planned design exploits the useful attribute of a single-hop (bus-based) interlayer communication of the 3D stacked mesh design to supply superior hardware multicast support. Finally customized partitioning approach and an effective routing method is given to decrease the average hop count and network latency. Compared to the recently designed 3D NOC architectures being capable of supporting hardware multicasting, huge simulations with traffic profiles reveals design exploitation, which is the planned multicast routing strategy will facilitate significant performance enhancements.
Optimized Design of 2D Mesh NOC Router using Custom SRAM & Common Buffer Util...VLSICS Design
With the shrinking technology, reduced scale and power-hungry chip IO leads to System on Chip. The design of SOC using traditional standard bus scheme encounters with issues like non-uniform delay and routing problems. Crossbars could scale better when compared to buses but tend to become huge with increasing number of nodes. NOC has become the design paradigm for SOC design for its highly regularized interconnect structure, good scalability and linear design effort. The main components of an NoC topology are the network adapters, routing nodes, and network interconnect links. This paper mainly deals with the implementation of full custom SRAM based arrays over D FF based register arrays in the design of input module of routing node in 2D mesh NOC topology. The custom SRAM blocks replace DFF(D flip flop) memory implementations to optimize area and power of the input block. Full custom design of SRAMs has been carried out by MILKYWAY, while physical implementation of the input module with SRAMs has been carried out by IC Compiler of SYNOPSYS.The improved design occupies approximately 30% of the area of the original design. This is in conformity to the ratio of the area of an SRAM cell to the area of a D flip flop, which is approximately 6:28.The power consumption is almost halved to 1.5 mW. Maximum operating frequency is improved from 50 MHz to 200 MHz. It is intended to study and quantify the behavior of the single packet array design in relation to the multiple packet array design. Intuitively, a
common packet buffer would result in better utilization of available buffer space. This in turn would translate into lower delays in transmission. A MATLAB model is used to show quantitatively how performance is improved in a common packet array design.
Optimized Design of 2D Mesh NOC Router using Custom SRAM & Common Buffer Util...VLSICS Design
With the shrinking technology, reduced scale and power-hungry chip IO leads to System on Chip. The design of SOC using traditional standard bus scheme encounters with issues like non-uniform delay and routing problems. Crossbars could scale better when compared to buses but tend to become huge with increasing number of nodes. NOC has become the design paradigm for SOC design for its highly regularized interconnect structure, good scalability and linear design effort. The main components of an NoC topology are the network adapters, routing nodes, and network interconnect links. This paper mainly deals with the implementation of full custom SRAM based arrays over D FF based register arrays in the design of input module of routing node in 2D mesh NOC topology. The custom SRAM blocks replace D FF(D flip flop) memory implementations to optimize area and power of the input block. Full custom design of SRAMs has been carried out by MILKYWAY, while physical implementation of the input module with SRAMs has been carried out by IC Compiler of SYNOPSYS.The improved design occupies approximately 30% of the area of the original design. This is in conformity to the ratio of the area of an SRAM cell to the area of a D flip flop, which is approximately 6:28.The power consumption is almost halved to 1.5 mW. Maximum operating frequency is improved from 50 MHz to 200 MHz. It is intended to study and quantify the behavior of the single packet array design in relation to the multiple packet array design. Intuitively, a
common packet buffer would result in better utilization of available buffer space. This in turn would translate into lower delays in transmission. A MATLAB model is used to show quantitatively how performance is improved in a common packet array design.
Diametrical Mesh of Tree (D2D-MoT) Architecture: A Novel Routing Solution for...IDES Editor
Network-on-chip (NoC) is a new aspect for designing
of future System-On-Chips (SoC) where a vast number of IP
cores are connected through interconnection network. The
communication between the nodes occurred by routing packets
rather than wires. It supports high degree of scalability,
reusability and parallelism in communication. In this paper,
we present a Mesh routing architecture, which is called
Diametrical 2D Mesh of Tree, based on Mesh-of-Tree (MoT)
routing and Diametrical 2D Mesh. It has the advantage of
having small diameter as well as large bisection width and
small node degree clubbed with being the fastest network in
terms of speed. The routing algorithm ensures that the packets
will always reach from source to sink through shortest path
and is deadlock free.
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.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
The French Revolution Class 9 Study Material pdf free download
DIA-TORUS:A NOVEL TOPOLOGY FOR NETWORK ON CHIP DESIGN
1. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
DOI: 10.5121/ijcnc.2016.8310 137
DIA-TORUS:A NOVEL TOPOLOGY FOR NETWORK
ON CHIP DESIGN
Deewakar Thakyal and Pushpita Chatterjee
SRM Research Institute, Bangalore
ABSTRACT
The shortcomings of conventional bus architectures are in terms of scalability and the ever increasing
demand of more bandwidth. And also the feature size of sub-micron domain is decreasing making it
difficult for bus architectures to fulfill the requirements of modern System on Chip (SoC) systems. Network
on chip (NoC) architectures presents a solution to the earlier mentioned shortcomings by employing a
packet based network for inter IP communications. A pivotal feature of NoC systems is the topology in
which the system is arranged. Several parameters which are topology dependent like hop count, path
diversity, degree and other various parameters affect the system performance. We propose a novel
topology forNoC architecture which has been thoroughly compared with the existing topologies on the
basis of different network parameters.
KEYWORDS
Network on chip, Torus, Topology, NoC
1. INTRODUCTION
Traditional bus architectures were working fine but then it started posing problems when too
many deep sub-micron devices started showing disparities and the focus shifted to scalability.
Scalability, being the primary goal, could not be achieved by bus architecture. These problems
needed a well-structured approach, clear programming and modular design. This led to the rise of
Network on Chip (NoC) architectures which offer promising solutions in terms of scalability and
ease of communication. The paradigm has now shifted its focus from computation to
communication and how it can cope with the scalability of the network. In most NoC
architectures, the network is a set of connected router with processing nodes attached to those
routers. Topology plays a crucial role in NoC, it defines how the cores are connected in a
network[1]. Different IP cores can be arranged in different ways paving the way for a number of
topologies that can be used for realizing a network. Topology affects the performance so it must
be selected with care. So, a good topology is one which offers less hop count, more path diversity
and can support load balancing. There are number of topologies in NoC which can be grouped as
regular and irregular topologies. Regular topologies are those which follow a fixed pattern and
can be divided into similar blocks. Irregular topologies don’t follow any fixed arrangement of
nodes.
In this paper we propose a novel topology, Dia-torus, for NoC systems. Present work aims at
reducing the hop count and latency parameters. It has diametrical connections that enhance its
performance. The proposed work is compared with the existing topologies. Different network
parameters are used for the comparison. RTL implementation is also done for area and power
2. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
138
consumption analysis of the proposed work and other topologies. The related work with detailed
description of the preliminary metrics for realizing a good NoC topology has been described in
Section 2. Section 3 discusses the proposed Dia-Torus topology and routing procedure in the
proposed topology. Weaddress the analysis and results that we get after comparing it with
different topologies and depicted in a tabular form in Section 4 to show the efficacy of the
proposed topology and conclude the paper by describing further future work in Section 5.
2. RELATED WORK
Topology designs become popular due to their simplicity and how easily they can be mapped
using the fabrication techniques in practice. Some of these are mesh, torus and folded torus. Mesh
is being used in number of NoC architectures namely, Intel's Teraflops containing 80 cores
forming a 10x8 2D mesh[2], Tilera's 2D mesh [3] with 64 nodes in 8x8 mesh, the TRIPS
processor [4] a wormhole routed 2D mesh with virtual channels. The complexity of router
implementation depends on the degree of the router as more degree leads to more
complexity.Number of buffers and ports required increases with increase in the number of degree.
Topologies like torus[5], folded torus[6] and mesh [7], have uniform degree routers and are easy
to implement whereas Dmesh[8], diametricmesh[9], Tmesh[10], xmesh, xtorus and xxtorus[11]
all have no uniform degree of routers. The new torus network which has the hypercube Q3 as the
basic module has been proposed[12]. The proposed Hyper-torus has the degree 4, and its network
has the node and its edge symmetric and is scalable. The extra links and ports require more
arbitration level and complex routing algorithms. Extra links in the topology can also help to
increase the load balancing capabilities of the topology.
The performance analysis and comparison of 2x4 Network on Chip (NoC)topology has been
done. First three common topologies, 2D Mesh topology, 2D Torus topology and hierarchical
Mesh topology, are designed and then the performances of these three topologies are analyzed
and compared in detail [12]. The simplicity of the regular mesh topology Network on Chip (NoC)
architecture leads to reductions in design time and manufacturing cost but it’s also unable to
efficiently support cores of different sizes.
2.1 PRELIMINARIES
A network topology comprises of different parameters and these parameters are gauged. On the
basis of these parameters a topology is considered better than the other topologies. Various
network parameters are explained in brief below.
• Degree: Degree of a router is the number of immediate neighbors it is connected to. In mesh
topology, every router has a degree of four and only the edge routers have a degree of three.
Degree of a router determines the ease of its implementation. Higher degree means the router
has more number of nodes as neighbors which lead to increase in the number of ports
resulting in more area and increase in implementation cost.
• Path Diversity: Path diversity is the number of shortest path between the two nodes in the
topology. A network topology having more path diversity will be better equipped for load
balancing. This results in better response to network congestion.
• Latency: Latency is the time taken by a packet to reach from its source to destination.
Another parameter to measure latency is the average minimum latency which is the minimum
of latencies of all the packets. Latency varies in a network due to congestion and traffic load.
It gives the performance of the network under different traffic conditions.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
139
• Throughput: Throughput of the network is defined as the rate of data processed by a
network in a given time and is represented as bits per second. Ideal condition in a network is
of maximum throughput where all the channels are transferring data to the full capacity. It is
also depended on other factors like flow control mechanisms and routing algorithms.
• Energy consumption: Transmission of packets through the network dissipates energy.
Topologies with more hop links tend to consume more energy. Another source of energy
consumption is the buffers in the router. Increasing temperatures can also give rise to hot
spots and lead to wear and tear of the chip.
2.2 NETWORK ON CHIP (NOC) TOPOLOGIES
NoCsystems can be implemented with many different topologies. The choice of topology
depends on the requirements and parameters like the complexity in implementing the topology,
the area it requires and its routing algorithm.
1.Mesh: Mesh is the most frequently used and basic used topology with very simple routing
algorithm. Mesh topology is easy to implement and is scalable. Except the corner and diagonal
nodes, every node is connected to the four neighboring nodes. A diagonal node has degree 2 and
the border nodes have degree 3 and all other nodes have degree 4 as shown in Fig.1. Mesh has a
larger network diameter due to its more hop count. For a 4x4 mesh, the network diameter is 6.
The diagonal nodes are the one which contribute to more hop count (node 1 to 16). For routing,
a XY routing algorithm can be used which routes packet based on the difference in co-ordinates.
Figure 1. Mesh Topology
2.Torus:Torus is another topology that is popular because of its long wrap around links and is
formed by connecting the boundary nodes in the same row and column as shown in the Fig.2.
Torus has long end to end links which leads to less network diameter and less hop count. For a
4x4 torus topology, the network diameter is 4 as compared to 6 in mesh. In mesh it took 6 hops to
reach diagonal nodes while it takes only 2 in torus. Torus requires long wires for the wrap around
links when compared to mesh.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
140
Figure 2. Torus Topology
3.Folded Torus:Another variant of torus is folded torus. Folded Torus has an advantage of
shorter link length which helps to reduce the time packet required to traverse in the
interconnected links. Shorter link length also contributes to the reduction in interconnect area
required for implementation. Folded torus also has more path diversity than torus and is fault
tolerant.
Figure 3. Folded Torus
4.Xmesh:Xmesh topology is an advancement of the existing mesh topology where it adds links in
the diagonal direction to the mesh topology as shown in Fig.2 which results in the reduction of
the diameter of the topology to half. In Xmesh topology, the hop count is also less than that of the
mesh topology. The additional diagonal links contribute to increase in the area. Number of extra
links added to xmesh topology is n for anXn mesh topology. Xmesh has diameter 3 for a 4x4
topology when compared to mesh which has a diameter value of 6
5. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
141
Figure 4.Xmesh Topology
5.Xtorus:Xtorus topology is also relatively new topology having diagonal connections where it
increases the links in diagonal directions as done in Xmesh. Xtorus inherits the long warp around
links of the torus topology. Diameter of Xtorus is better than torus whose diameter is (n-1) when
compared to that of torus (n).
Figure 5.Xtorus Topology
6.King mesh:King mesh is a topology used is areas where parallel processing is a key aspect. In
king mesh, every node is connected to its neighbor as shown in fig. Nodes that are in the center
of the topology have higher degree than other nodes. Routers with higher degree have more area
because of the extra buffers that are required for the extra ports that contribute to greater degree.
Owing to greater number connections, the diameter of king mesh is less and the relative hoop
count is also less.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
142
Figure 6. King Mesh Topology
7.King torus:King torus is another topology like king mesh. King torus, just as king mesh, is a
torus topology having connections with all the neighboring routers. King torus will also have
lager areas values than other regular topologies because of the extra ports in the routers. It also
offers more in performance when compared to king mesh and other topologies as a result of the
long connections between end to end nodes, both horizontally and diagonally.
Figure 7. King Torus Topology
3. PROPOSED WORK: DIA-TORUS TOPOLOGY
In this paper, we propose a new topology, Dia-Torus, which is a hybrid topology with features of
both mesh and torus topologies. In addition to the long vertical and horizontal links that torus has,
Dia-Torus has diagonal links that connect the four edge nodes with the nodes in the second last
row of the topology as shown in Fig 4. The edge routers having diagonal links do not need an
additional port. Only the four nodes need 5 port routers that are connected with those diagonal
links. Since only four 5 port routers are used irrespective of the size of topology, there is only
slight increase in the area. The diagonal links help in reducing the hop count by a significant
value. Moreover, the diameter of the topology is also reduced because of the presence of these
links. In the Fig.4, nodes 1, 4, 13, 16 are edge nodes and nodes 1 to 4, 5, 8,9,12 and 13 to 16are
border nodes.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
143
Figure 8.Dia-Torus Topology
3.1 ROUTER ARCHITECTURE
Network on chip (NoC) architectures are implemented as tile based structure to ease on chip
communications [13][14][15]. A tile can be a general purpose processor, a memory subsystem
etc. A router is attached which connects this tile to neighboring nodes. All communications with
the other nodes in the architecture are done via this router. Figure 9(a) shows the tile structure and
basic router architecture is shown in Figure 9(b). The router has 4 named on directions as east,
west, north and south. There is another port, local port, dedicated port for communication with
the processing core. Buffers are usually attached to store incoming data
Figure 9:(a) NoC tile with processing core and router. (b) Noc 4 port router
Present work has a router with an additional port for the diagonal connections. There are only
4routers in the topology that have an extra port. The extra port leads to a slight increase in area of
the router but it also manages to route packets efficiently reducing the overall hop count. The
router structure is shown in figure 10.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
144
Figure 10. 5 port router used in Dia-torus
3.2 ROUTING ALGORITHM
The routing algorithm for the present work is based upon the routing algorithm for torus.
Additional conditions necessary for the topology are added. It has four routers that have an extra
port named diagonal port for long diametrical connections. Edge routers have diametrical
connections attached to the existing port only and no extra port is added. For anxnDia-torus the
routing algorithm is as follows
1. If the source node is a border node:
a. If source is an edge node and destination is in the opposite quadrant with x and y
offset greater than n/2, take the diametrical link;
b. For destination nodes with hop count less than that, routing is done as in the case
of torus by taking the wrap around links in considerations to hop farther nodes
and normal XY for rest of the nodes.
i. Exceptions are the four edge nodes don’t have horizontal wrap around
links so additional condition for packet to move are written.
c. For all border nodes except the edge nodes, routing algorithm is same as that of
torus for both offset less than n/2. Else nearest router with diametrical link is
taken.
2. For nodes that are not border nodes, if both x and y offset are greater than n/2,
a. Go to the nearest node with a diametrical link, 5 port router, and move directly.
b. Else routing algorithm is same as torus.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
145
4.RESULTS AND COMPARISON
The proposed work is compared with different topologies on the basis of several network
parameters. The topologies mentioned in the preliminaries are used for the comparison.
•••• Hop Count:Hop count is the number of nodes that a flit traverses from its source to
destination. Dia-Torus has a significant decrease in hop count when compared with the
existing topology.The reduction in hop count when compared with the existing topologies
is:31% for mesh, 13% for torus, 5.1% for twisted torus. Table 1 shows the hop count
comparison of different topologies with Dia-Torus.
•••• Network Diameter:Network Diameter is to the largest, minimal hop count over all pairs
of nodes in the network. In anxn network, the diameter ofmesh is 2(n-1), for xmesh itsn-1.
When n is odd, the diameter of torus is n-1 and n for even values. The network diameter
ofxtorusisn-1. For king mesh and king torus diameter is n-1. Dia-torus also has diameter of
n-1. Table 1 compares the diameter value of the topologies.
•••• Ideal Average Latency: For a given topology, assuming that there is no congestion in the
network, the average delay between all the nodes in the topology is called the ideal
average latency(T). It can be calculated by the formula
= + +
Where H is the average hop count from source node to destination node, is the delay in routing
on the router, and the unit is cycle/hop,Dis the average distance from the source node to
destination node, which usually equals to H, and the unit is hop. vis the wire transmission speed,
and the unit is hop/cycle, L is the packet length, and the unit is flit. bis the bandwidth, and the unit
is flit/cycle. Generally, different topologies correspond to different H and D values, while Tris
dependent on the routing algorithm and the physical implementation of the router.From the Table
1, it can be seen that latency value for proposed work is 26.4% less than that of mesh, 11.08%
less than torus, 3.8% less than that of twisted torus. It also has less latency value compared to that
of Xmesh, 6.1% less and equal to xtorus but with less number of links.
• Ideal Throughput: For a given topology, ideal throughput is the maximum network
throughput in a perfect flow control and routing mechanism. William James Dally, et al.,
gave a formula [1]for calculating the ideal throughput (TH). Bcis the number of channels
required to divide the whole network into two equal halves; b is the width of each
channel, N is the number of nodes.
TH <=2b*Bc/ N
Taking 4×4 node scale for example, for mesh, it takes four links to divide it into two halves and
each link is bidirectional, so Bc= 8. In the same way, it is easy to get that Bc for
torus,xmesh,xtorusand Dia-Toruswhich equals to 16, 12, 20and 20 respectively.Assuming that all
other parameters are constant, the ideal throughput of Dia-Torus increases by 150% when it is
compared with that of mesh,and increases by 25% compared with that of torus and60% xmesh.
•••• Path diversity:Path diversity is the property of a topology to possess more than one
shortest path between two nodes. With better path diversity, it is possible to select between
more multiple shortest paths, which can effectively reduce network congestion and
enhance network fault tolerance.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
146
Table I: Table showing comparison of proposed work with different topologies`
• Physical Implementation Difficulty and Area:The physical implementation difficulty
of different topologies depends on the symmetry of the structure, the number of
dimensions, the number of long edges, the number of ports of each router and the area
occupied by the topology. More the number of ports in the router more are the buffer
requirements which increase the area of the router. Table II and Table III describes the
comparison between different topologies with respect to number of links and area
consumption.
Table II: Table showing number of links comparison of proposed work with different topologies
Topology Mesh Torus Xmesh Xtorus Dia-Torus
Number of links 2n(n-1) 2 2 2 +2(n-1) 2 +2
Table III: Table showing area comparison of proposed work with different topologies
• Energy consumption: Power consumed by packets is another factor that affects network
performance. Table IV shows the power consumed by different topologies under same
traffic conditions. As can be seen, the present work consumes less power than mesh and
torus topologies.
Table IV: Table showing energy comparison of proposed work with different topologies
Topology Mesh Torus Folded Torus Dia-Torus
Total Power
consumed( )
1.4889e+04 1.5121e+04 1.1415e+04 1.4696e+04
Topology Mesh Torus Folded
Torus
King
Mesh
King
Torus
Xmes
h
Xtorus Dia-Torus
Hop Count 644 514 468 456 396 460 444 444
Diameter 6 4 4 3 3 3 3 3
Latency 14.5 12 13.32 10.9 10.75 11.37 10.67 10.67
Path
Diversity
2.96 2 2.24 4.14 4.34 1.4 2.08 1.62
Topology Mesh Torus Folded Torus Dia-Torus
Total
area( )
2703521.651525 2875182.661041 2883018.998952 2891311.592451
11. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
147
5. CONCLUSIONS AND FUTURE WORKS
From the above results it can be concluded that the proposed work offers significant advantages
in hop count and diameter.Dia-torus also offer more ideal throughput when compared to existing
topologies. Latency of the present work is also less. It is comparable with latency values of king
torus and xtorus which have more number of links than the proposed work.Proposed work has a
trade off in terms of path diversity. When compared with mesh, torus and othertopologies,
proposed work loses some path diversity. The proposed topology has a slight increase in the area
which is negligible when the advantages are considered. Routing algorithm for the proposed work
doesn’t handle faulty links. A new fault free and deadlock free routing algorithm will be
developed in near future. Also, the proposed topology will be implemented in ASIC.We are
working on implementing the proposed topology on NoC simulator Noxim [14] and
the functionality of Noxim [15] will be extended for evaluation of faulty links in a network and
network simulation will be done with those faulty links and how the performance is affected.
REFERENCES
[1] W. J. Dally, B. Towles, Principles and Practices of Interconnection Networks, Morgan Kaufmann
Pub., San Francisco, CA, 2004.
[2] S. Vangal et al, “An 80-Tile 1.28TFLOPS Network-on-Chip in 65nm CMOS”, In proceedings of
IEEEInternational Solid-State Circuits Conf., Digest of Tech. Papers (ISSCC),pp. 98-10, 2007.
[3] A. Agarwal, L. Bao, J. Brown, B. Edwards, M. Mattina, C.C. Miao, C. Ramey, D. Wentzlaff, “Tile
Processor: Embedded Multicore for Networking and Multimedia”, In proceedings of HotChips19,
Stanford, CA, Aug. 2007.
[4] P. Gratz, C. Kim, R. McDonald, S. W. Keckler, D. C. Burger, “Implementation and evaluation of on-
chip network architectures”, In proceedings of Int. Conf. Computer Design,pp.477-484,2006.
[5] Kumar,S, Jantsch,A, Soininen,J.P, Forsell,M, Millberg,M, Oberg,J, Tiensyrja,K, Hemani,A, “A
network on chip architecture and design methodology”. In proceedings of IEEE Computer Society
Annual Symposium onVLSI,pp.105-112,2002.
[6] W. J. Dally and C. L. Seitz., “The Torus routing chip”, Journal of Distributed Computing, pp.187-
196,1986.
[7] W. J. Dally and B. Towles., “Route packets, not wires: on-chip interconnection networks”, In
proceedings of DAC,pp. 684-689,2001.
[8] Chifeng Wang, Wen-Hsiang Hu, SeungEun Lee, Nader Bagherzadeh, “Area and power-efficient
innovative congestion-aware Network-on- Chip architecture”, Journal of Systems Architecture,
pp.24-38,2011.
[9] M. Reshadi, A. Khademzadeh, A. Reza, M. Bahmani, “A Novel Mesh Architecture for On-Chip
Networks”, Design and Reuse Industry Articles,2013.
[10] Quansheng Yang, Zhekai Wu, “An Improved Mesh Topology and Its Routing Algorithm for NoC”,In
proceedings of International Conference on Computational Intelligence and Software Engineering
(CiSE), (2010), pp:1-4.
[11] Liu Yu-hang, Zhu Ming-fa, Wang Jue, Xiao Li-min, Gong Tao, “Xtorus: An Extended Torus
Topology for On-Chip Massive Data Communication”, In proceedings ofIEEE 26th International
Symposium Workshops & PhD Forum on Parallel and Distributed Processing,pp.2061-2068,2012.
[12] Woo-seo Ki, Hyeong-Ok Lee, Jae-Cheol Oh, “The New Torus Network Design Based On 3-
Dimensional Hypercube”,In proceedings of 11th International Conference on Advanced
Communication Technology, ICACT 2009, Vol:01, 2009.
[13] A. Hemani et al., “Network on a chip: An architecture for billion transistor era,” in Proc. IEEE
NorChip Conf., Nov. 2000, pp. 166–173.
[14] S. Kumar et al., “A network on chip architecture and design methodology,” in Proc. Symp. VLSI,
Apr. 2002, pp. 105–112.
[15] W. J. Dally and B. Towles, “Route packets, not wires: on-chip interconnection networks,” in Proc.
Design Automation Conf., Jun. 2001, pp.684–689
12. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
148
[16]J uyeob Kim, Miyoung Lee, Wonjong Kim, Junyoung Chang, YounghwanBae and Hanjin Cho
“Performance analysis of NoC structure based star mesh topology”,In proceedings of SoC Design
Conference, ISOCC '08, Vol:02, 2008.
[17] F Fazzino., M Palesi., D Patti., “Noxim: Network-on-Chip Simulator”, url:
http://sourceforge.net/projects/noxim/ accessed on April, 2016.
[18] K. Swaminathan, D. Thakyal, S. G. Nambiar, G. Lakshminarayanan and Seok-Bum Ko, “Enhanced
Noxim simulator for performance evaluation of network on chip topologies,” In proceedings of
Recent Advances of Engineering and Computational Sciences (RAECS), 2014, pp. 1-5, 2014.
AUTHORS
Pushpita Chatterjee is working as a research lead at SRM Research Institute, Bangalore
since 2012. She completed her PhD from Indian Institute of Technology Kharagpur, India
in 2012. She has over 15 publications to her credit in international journals and
conferences. Her research interests are mobile computing, distributed and trust computing,
wireless ad hoc and sensor networks, network on chip, information-centric networking an
software-defined networking.
Deewakar Thakyal is working as a research member at SRM Research Institute,
Bangalore since 2015. He received his Master’s degree from National Institute of
Technology, Tiruchirappalli, India in 2014. His research interests are network on chip,
internet of t hings, sensor networks and cyber physical systems.