Science Publishing Group: American Journal of Networks and Communications: Table of Contents
<i> American Journal of Networks and Communications (AJNC) </i> is a bimonthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of networks & communications. The journal focuses on all technical and practical aspects of networks and communications. The goal of this journal is to bring together researchers and practitioners universities, laboratories and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
http://www.sciencepublishinggroup.com/j/ajnc Science Publishing Group: American Journal of Networks and Communications: Table of Contents
Science Publishing Group
en-US
American Journal of Networks and Communications
American Journal of Networks and Communications
http://image.sciencepublishinggroup.com/journal/132.gif
http://www.sciencepublishinggroup.com/j/ajnc
Ghais El Zein. MIMO Hardware Simulator Design for Heterogeneous Indoor Environments Using Tgn Channel Models
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20120101.12
A wireless communication system can be tested either in actual conditions or by using a hardware simulator reproducing actual conditions. With a hardware simulator it is possible to freely simulate a desired type of a radio channel. This paper presents new frequency domain and time domain architectures for the digital block of a hardware simulator of Multiple-Input Multiple-Output (MIMO) propagation channels. This simulator can be used for Wireless Local Area Networks (WLAN) 802.11ac applications. It characterizes an indoor scenario using TGn channel models. After the description of the general characteristics of the hardware simulator, the new architectures of the digital block are presented and designed on a Xilinx Virtex-IV Field Programmable Gate Array (FPGA). Their accuracy, occupation on the FPGA and latency are analyzed.
A wireless communication system can be tested either in actual conditions or by using a hardware simulator reproducing actual conditions. With a hardware simulator it is possible to freely simulate a desired type of a radio channel. This paper presents new frequency domain and time domain architectures for the digital block of a hardware simulator of Multiple-Input Multiple-Output (MIMO) propagation channels. This simulator can be used for Wireless Local Area Networks (WLAN) 802.11ac applications. It characterizes an indoor scenario using TGn channel models. After the description of the general characteristics of the hardware simulator, the new architectures of the digital block are presented and designed on a Xilinx Virtex-IV Field Programmable Gate Array (FPGA). Their accuracy, occupation on the FPGA and latency are analyzed.
Ghais El Zein. MIMO Hardware Simulator Design for Heterogeneous Indoor Environments Using Tgn Channel Models
doi:10.11648/j.ajnc.20120101.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Bachir Habib
Gheorghe Zaharia
Ghais El Zein
Ghais El Zein. MIMO Hardware Simulator Design for Heterogeneous Indoor Environments Using Tgn Channel Models
1
1
16
16
2014-01-01
2014-01-01
10.11648/j.ajnc.20120101.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20120101.12
© Science Publishing Group
Matrix Inversion Algorithm: Applications in High Speed MIMO LTE Receiver
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20120101.11
Matrix inversion algorithm acting an important role in MIMO wireless communication.In this paper, we presenta matrix inversion algorithm and it’s applications in the high speed MIMO LTE receiver which is based on floating point DSP. Matrix operations are the most costly computational module within MIMO receivers but a matrix inversion algorithm is very easy to compute and significantly reduce the computational module cost. We will demonstrate the MIMO LTE applications for reducing the module cost by square matrix inversion algorithms.
Matrix inversion algorithm acting an important role in MIMO wireless communication.In this paper, we presenta matrix inversion algorithm and it’s applications in the high speed MIMO LTE receiver which is based on floating point DSP. Matrix operations are the most costly computational module within MIMO receivers but a matrix inversion algorithm is very easy to compute and significantly reduce the computational module cost. We will demonstrate the MIMO LTE applications for reducing the module cost by square matrix inversion algorithms.
Matrix Inversion Algorithm: Applications in High Speed MIMO LTE Receiver
doi:10.11648/j.ajnc.20120101.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Moon Ho Lee
Matrix Inversion Algorithm: Applications in High Speed MIMO LTE Receiver
1
1
6
6
2014-01-01
2014-01-01
10.11648/j.ajnc.20120101.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20120101.11
© Science Publishing Group
Optimization of Core Network Router for Telecommunication Exchange
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130201.11
The operation of Core Router is to restrict Network Broadcast to the LAN, to act as default gateway, to move data between different networks and to advertise loop free Path. The technology of Wifi, WiMAX (Worldwide Interoperability for Microwave Access), GPRS (General Packet Radio Services), EDGE (Enhanced Data Rates For GSM Evolution), EV-DO (Evolution Data Optimized) which are used for remote data access. A Router must be able to support multiple telecommunications interfaces of the highest speed in use in the core Internet and must be able to forward IP packets at full speed on all of them. It must also support the routing protocols being used in the core. In telephone system, Core Routers installed on the network are used as carriers to carry data from traffic sources to sinks. The optimization formulation based on Telecommunication network to obtain an optimal decision for the Core Router on whether to accept packets from a traffic source. This decision is made to maximize the reward of data delivery while the quality-of-service performance is guaranteed. From the performance evaluation, a Core Router with network optimization can achieve the highest reward while the maximum packet-blocking probability requirements met. The Core Router is a cell-site access platform specifically designed to optimize, aggregate and transport mixed-generation Radio Access Network (RAN) traffic. It is used at a cell site as part of an IP-RAN or Cell Site DCN solution. An IP RAN solution in which the Core Router extends IP connectivity to the cell site and Base Transceiver Station (BTS), through a Fast Ethernet interface to the BTS, the router provides bandwidth-efficient IP transport of voice and data bearer traffic, as well as maintenance, control and signaling traffic over the IP using traditional circuits.
The operation of Core Router is to restrict Network Broadcast to the LAN, to act as default gateway, to move data between different networks and to advertise loop free Path. The technology of Wifi, WiMAX (Worldwide Interoperability for Microwave Access), GPRS (General Packet Radio Services), EDGE (Enhanced Data Rates For GSM Evolution), EV-DO (Evolution Data Optimized) which are used for remote data access. A Router must be able to support multiple telecommunications interfaces of the highest speed in use in the core Internet and must be able to forward IP packets at full speed on all of them. It must also support the routing protocols being used in the core. In telephone system, Core Routers installed on the network are used as carriers to carry data from traffic sources to sinks. The optimization formulation based on Telecommunication network to obtain an optimal decision for the Core Router on whether to accept packets from a traffic source. This decision is made to maximize the reward of data delivery while the quality-of-service performance is guaranteed. From the performance evaluation, a Core Router with network optimization can achieve the highest reward while the maximum packet-blocking probability requirements met. The Core Router is a cell-site access platform specifically designed to optimize, aggregate and transport mixed-generation Radio Access Network (RAN) traffic. It is used at a cell site as part of an IP-RAN or Cell Site DCN solution. An IP RAN solution in which the Core Router extends IP connectivity to the cell site and Base Transceiver Station (BTS), through a Fast Ethernet interface to the BTS, the router provides bandwidth-efficient IP transport of voice and data bearer traffic, as well as maintenance, control and signaling traffic over the IP using traditional circuits.
Optimization of Core Network Router for Telecommunication Exchange
doi:10.11648/j.ajnc.20130201.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Diponkar Paul
Subrata Kumar Sarkar
Rajib Mondal
Optimization of Core Network Router for Telecommunication Exchange
2
1
8
8
2014-01-01
2014-01-01
10.11648/j.ajnc.20130201.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130201.11
© Science Publishing Group
A Journal of Real Peak Recognition of Electrocardiogram (ECG) Signals Using Neural Network
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130201.12
This paper describes about the analysis of electrocardiogram (ECG) signals using neural network approach. Heart structure is a unique system that can generate ECG signals independently via heart contraction. Basically, an ECG signal consists of PQRST wave. All these waves are represented respective heart functions. Normal healthy heart can be simply recognized by normal ECG signal while heart disorder or arrhythmias signals contain differences in terms of features and morphological attributes in their corresponding ECG waveform. Some major important features will be extracted from ECG signals such as amplitude, duration, pre-gradient, post-gradient and so on. These features will then be fed as an input to neural network system. The target output represented real peaks of the signals is also being defined using a binary number. Result obtained showing that neural network pattern recognition is able to classify and recognize the real peaks accordingly with overall accuracy of 81.6% although there might be limitations and misclassification happened. Future recommendations have been highlighted to improve network’s performance in order to get better and more accurate result.
This paper describes about the analysis of electrocardiogram (ECG) signals using neural network approach. Heart structure is a unique system that can generate ECG signals independently via heart contraction. Basically, an ECG signal consists of PQRST wave. All these waves are represented respective heart functions. Normal healthy heart can be simply recognized by normal ECG signal while heart disorder or arrhythmias signals contain differences in terms of features and morphological attributes in their corresponding ECG waveform. Some major important features will be extracted from ECG signals such as amplitude, duration, pre-gradient, post-gradient and so on. These features will then be fed as an input to neural network system. The target output represented real peaks of the signals is also being defined using a binary number. Result obtained showing that neural network pattern recognition is able to classify and recognize the real peaks accordingly with overall accuracy of 81.6% although there might be limitations and misclassification happened. Future recommendations have been highlighted to improve network’s performance in order to get better and more accurate result.
A Journal of Real Peak Recognition of Electrocardiogram (ECG) Signals Using Neural Network
doi:10.11648/j.ajnc.20130201.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Tarmizi Amani Izzah
Syed Sahal Nazli Alhady
Umi Kalthum Ngah
Wan Pauzi Ibrahim
A Journal of Real Peak Recognition of Electrocardiogram (ECG) Signals Using Neural Network
2
1
16
16
2014-01-01
2014-01-01
10.11648/j.ajnc.20130201.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130201.12
© Science Publishing Group
Node Selection in P2P Content Sharing Service in Mobile Cellular Networks with Reduction Bandwidth
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.13
The peer-to-peer service has entered the public limelight over the last few years. Several research projects are underway on peer-to-peer technologies, but no definitive conclusion is currently available. Comparing to traditional server-client technology on the internet, the P2P technology has capabilities to realize highly scalable, extensible and efficient distributed applications. At the same time mobile networks such as WAP, wireless LAN and Bluetooth have been developing at breakneck speed. Demand for using peer-to-peer applications over PDAs and cellular phones is increasing. The purpose of this study is to explore a mobile peer-to-peer network architecture where a variety of devices communications each other over a variety of networks. In this paper, we propose the architecture well-adapted to mobile devices and mobile network. In P2P file sharing systems over mobile cellular networks, the bottleneck of file transfer speed is usually the downlink bandwidth of the receiver rather than the uplink bandwidth of the senders. In this paper we consider the impact of downlink bandwidth limitation on file transfer speed and propose two novel peer selection algorithms named DBaT-B and DBaT-N, which are designed for two different cases of the requesting peer’s demand respectively. Our algorithms take the requesting peer’s downlink bandwidth as the target of the sum of the selected peers’ uplink bandwidth. To ensure load balance on cells, they will first choose a cell with the lowest traffic load before choosing each peer.
The peer-to-peer service has entered the public limelight over the last few years. Several research projects are underway on peer-to-peer technologies, but no definitive conclusion is currently available. Comparing to traditional server-client technology on the internet, the P2P technology has capabilities to realize highly scalable, extensible and efficient distributed applications. At the same time mobile networks such as WAP, wireless LAN and Bluetooth have been developing at breakneck speed. Demand for using peer-to-peer applications over PDAs and cellular phones is increasing. The purpose of this study is to explore a mobile peer-to-peer network architecture where a variety of devices communications each other over a variety of networks. In this paper, we propose the architecture well-adapted to mobile devices and mobile network. In P2P file sharing systems over mobile cellular networks, the bottleneck of file transfer speed is usually the downlink bandwidth of the receiver rather than the uplink bandwidth of the senders. In this paper we consider the impact of downlink bandwidth limitation on file transfer speed and propose two novel peer selection algorithms named DBaT-B and DBaT-N, which are designed for two different cases of the requesting peer’s demand respectively. Our algorithms take the requesting peer’s downlink bandwidth as the target of the sum of the selected peers’ uplink bandwidth. To ensure load balance on cells, they will first choose a cell with the lowest traffic load before choosing each peer.
Node Selection in P2P Content Sharing Service in Mobile Cellular Networks with Reduction Bandwidth
doi:10.11648/j.ajnc.20130202.13
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
S. Uvaraj
S. Suresh
E. Mohan
Node Selection in P2P Content Sharing Service in Mobile Cellular Networks with Reduction Bandwidth
2
2
46
46
2014-01-01
2014-01-01
10.11648/j.ajnc.20130202.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.13
© Science Publishing Group
Finnish Perspectives for the IOT
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.11
The Internet of Things (IOT) means connecting people, things, and devices in order to create an omnipresent computing world. One of the most important challenges in convincing users to adopt this kind of all-around network is the protection of security and privacy in different applications. This paper presents the results of interviews conducted in a Finnish study during 8/2012-2/2013. In this research, 11 Finnish people working with different aspects of IOT development and 11 ordinary Finnish people were interviewed. The goal was to investigate their feelings on the IOT and its applications, as well as personal opinions on security and individual privacy in the IOT. Most of the answerers in this study believed that we are heading towards the IOT in the future and many IOT applications were seen tempting. However, security and privacy issues, the lack of control, and the actual need for versatile IOT applications were questioned. The people working with the IOT were found to be more critical towards the IOT than the ordinary people. An introduction of the IOT, examples of potential applications, the conducted interviews and collected answers, as well as highlights of the collected free comments are presented in this paper.
The Internet of Things (IOT) means connecting people, things, and devices in order to create an omnipresent computing world. One of the most important challenges in convincing users to adopt this kind of all-around network is the protection of security and privacy in different applications. This paper presents the results of interviews conducted in a Finnish study during 8/2012-2/2013. In this research, 11 Finnish people working with different aspects of IOT development and 11 ordinary Finnish people were interviewed. The goal was to investigate their feelings on the IOT and its applications, as well as personal opinions on security and individual privacy in the IOT. Most of the answerers in this study believed that we are heading towards the IOT in the future and many IOT applications were seen tempting. However, security and privacy issues, the lack of control, and the actual need for versatile IOT applications were questioned. The people working with the IOT were found to be more critical towards the IOT than the ordinary people. An introduction of the IOT, examples of potential applications, the conducted interviews and collected answers, as well as highlights of the collected free comments are presented in this paper.
Finnish Perspectives for the IOT
doi:10.11648/j.ajnc.20130202.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Johanna Virkki
Finnish Perspectives for the IOT
2
2
27
27
2014-01-01
2014-01-01
10.11648/j.ajnc.20130202.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.11
© Science Publishing Group
Defending WSNs Against Jamming Attacks
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.12
Wireless sensor networks WSNs consist of a group of distributed monitor nodes working autonomously together cooperatively to achieve a common goal. Generally they face many threats, threatening the security and integrity of such networks. Jamming attacks are one of the most common attacks used against WSNs. In this paper we discuss the jamming attack and defense mechanisms proposed by two papers and suggest improvements on those four approaches.
Wireless sensor networks WSNs consist of a group of distributed monitor nodes working autonomously together cooperatively to achieve a common goal. Generally they face many threats, threatening the security and integrity of such networks. Jamming attacks are one of the most common attacks used against WSNs. In this paper we discuss the jamming attack and defense mechanisms proposed by two papers and suggest improvements on those four approaches.
Defending WSNs Against Jamming Attacks
doi:10.11648/j.ajnc.20130202.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Abdulaziz Rashid Alazemi
Defending WSNs Against Jamming Attacks
2
2
39
39
2014-01-01
2014-01-01
10.11648/j.ajnc.20130202.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.12
© Science Publishing Group
Cryptography: Salvaging Exploitations against Data Integrity
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.14
Cryptography is the science and art of codes that makes it possible for two people to exchange data in such a way that other people cannot understand the message. In this study – we are concerned with methods of altering data such that its recipient can undo the alteration and discover the original text. The original text is called plaintext (PT) while altered text is ciphertext (CT). Conversion from PT to CT is called encoding/enciphering as codes that result from this process are called ciphers. The reverse operation is called decoding/deciphering. If a user tries to reverse the cipher by making meaning of it without prior knowledge of what method is used for encoding as the data was originally, not intended for the user, the process is called cracking, while such a user is a called a cryptanalyst. Cryptography is about communicating in the presence of an adversary (cryptanalyst) – and it embodies problems such as (encryption, authentication, key distribution to name a few). The field of cryptography and informatics provides a theoretical foundation based on which we may understand what exactly these problems are, how to evaluate protocols that purport to solve them, and how to build protocols in whose security we can have confidence. Thus, cryptography is the only practical means of sending and receiving data over an insecure channel from source to destination in such a way that other users cannot understand the message unless it was intended for them. Data sent over public network is not safe and the more ciphertext a cryptanalyst has, the easier it is to crack the ciphers. Thus, it is good to change the coding mechanism regularly – because, every coding scheme has a key set.
Cryptography is the science and art of codes that makes it possible for two people to exchange data in such a way that other people cannot understand the message. In this study – we are concerned with methods of altering data such that its recipient can undo the alteration and discover the original text. The original text is called plaintext (PT) while altered text is ciphertext (CT). Conversion from PT to CT is called encoding/enciphering as codes that result from this process are called ciphers. The reverse operation is called decoding/deciphering. If a user tries to reverse the cipher by making meaning of it without prior knowledge of what method is used for encoding as the data was originally, not intended for the user, the process is called cracking, while such a user is a called a cryptanalyst. Cryptography is about communicating in the presence of an adversary (cryptanalyst) – and it embodies problems such as (encryption, authentication, key distribution to name a few). The field of cryptography and informatics provides a theoretical foundation based on which we may understand what exactly these problems are, how to evaluate protocols that purport to solve them, and how to build protocols in whose security we can have confidence. Thus, cryptography is the only practical means of sending and receiving data over an insecure channel from source to destination in such a way that other users cannot understand the message unless it was intended for them. Data sent over public network is not safe and the more ciphertext a cryptanalyst has, the easier it is to crack the ciphers. Thus, it is good to change the coding mechanism regularly – because, every coding scheme has a key set.
Cryptography: Salvaging Exploitations against Data Integrity
doi:10.11648/j.ajnc.20130202.14
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
A. A. Ojugo
A. O. Eboka
M. O. Yerokun
I. J. B. Iyawa
R. E. Yoro
Cryptography: Salvaging Exploitations against Data Integrity
2
2
55
55
2014-01-01
2014-01-01
10.11648/j.ajnc.20130202.14
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130202.14
© Science Publishing Group
AquaMesh - Design and Implementation of Smart Wireless Mesh Sensor Networks for Aquaculture
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.15
In this paper we design and implemented a dynamic and smart wireless mesh sensor network for aquaculture and water quality management applications. This system utilizes the Waspmote embedded systems platform developed by Libelium, mesh networking transceivers from Digi International and smart sensors from UNISM to implement a novel smart Wireless Mesh Sensor network –Aquamesh with multiple gateways of different technologies (Zigbee, GPRS and WIFI). The system is designed to continuously monitor aqua-environmental parameters and then initiate an alert or early warning to system user when certain thresholds are exceeded. The data generated from this system is stored locally on the gateway or sent to a remote web server. Data on the local database or remote web server can be accessed with smart mobile phones or personal computers. The experimental results show that the system presented in this paper is feasible to implement and present results consistent with traditional aqua-quality monitoring systems. This system will find application in the monitoring of marine and wetlands environments like fish ponds, coastal water pollution monitoring systems, effluent and sewage treatment plants, offshore oil and gas drilling facilities.
In this paper we design and implemented a dynamic and smart wireless mesh sensor network for aquaculture and water quality management applications. This system utilizes the Waspmote embedded systems platform developed by Libelium, mesh networking transceivers from Digi International and smart sensors from UNISM to implement a novel smart Wireless Mesh Sensor network –Aquamesh with multiple gateways of different technologies (Zigbee, GPRS and WIFI). The system is designed to continuously monitor aqua-environmental parameters and then initiate an alert or early warning to system user when certain thresholds are exceeded. The data generated from this system is stored locally on the gateway or sent to a remote web server. Data on the local database or remote web server can be accessed with smart mobile phones or personal computers. The experimental results show that the system presented in this paper is feasible to implement and present results consistent with traditional aqua-quality monitoring systems. This system will find application in the monitoring of marine and wetlands environments like fish ponds, coastal water pollution monitoring systems, effluent and sewage treatment plants, offshore oil and gas drilling facilities.
AquaMesh - Design and Implementation of Smart Wireless Mesh Sensor Networks for Aquaculture
doi:10.11648/j.ajnc.20130203.15
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Adinya John Odey
Li Daoliang
AquaMesh - Design and Implementation of Smart Wireless Mesh Sensor Networks for Aquaculture
2
3
87
87
2014-01-01
2014-01-01
10.11648/j.ajnc.20130203.15
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.15
© Science Publishing Group
Authority System to Prevent Privacy Protection in Peer-to-Peer Network System
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.13
Collusive piracy is the main source of intellectual property violations within the boundary of a P2P network. Paid clients (colluders) may illegally share copyrighted content files with unpaid clients (pirates). Such online piracy has hindered the use of open P2P networks for commercial content delivery. We proposed a proactive content poisoning scheme to stop colluders and pirates from alleged copyright infringements in P2P file sharing. The basic idea is to detect pirates timely with identity-based signatures and time-stamped tokens. The scheme stops collusive piracy without hurting legitimate P2P clients by targeting poisoning on detected violators, exclusively. We developed a new peer authorization protocol (PAP) to distinguish pirates from legitimate clients. Detected pirates will receive poisoned chunks in their repeated attempts. Pirates are thus severely penalized with no chance to download successfully in tolerable time. Based on simulation results, we find 99.9 percent prevention rate in Gnutella, KaZaA, and Freenet. We achieved 85-98 percent prevention rate on eMule, eDonkey, Morpheus, etc. The scheme is shown less effective in protecting some poison-resilient networks like BitTorrent and Azureus. Our work opens up the low-cost P2P technology for copyrighted content delivery. The advantage lies mainly in minimum delivery cost, higher content availability, and copyright compliance in exploring P2P network resources.
Collusive piracy is the main source of intellectual property violations within the boundary of a P2P network. Paid clients (colluders) may illegally share copyrighted content files with unpaid clients (pirates). Such online piracy has hindered the use of open P2P networks for commercial content delivery. We proposed a proactive content poisoning scheme to stop colluders and pirates from alleged copyright infringements in P2P file sharing. The basic idea is to detect pirates timely with identity-based signatures and time-stamped tokens. The scheme stops collusive piracy without hurting legitimate P2P clients by targeting poisoning on detected violators, exclusively. We developed a new peer authorization protocol (PAP) to distinguish pirates from legitimate clients. Detected pirates will receive poisoned chunks in their repeated attempts. Pirates are thus severely penalized with no chance to download successfully in tolerable time. Based on simulation results, we find 99.9 percent prevention rate in Gnutella, KaZaA, and Freenet. We achieved 85-98 percent prevention rate on eMule, eDonkey, Morpheus, etc. The scheme is shown less effective in protecting some poison-resilient networks like BitTorrent and Azureus. Our work opens up the low-cost P2P technology for copyrighted content delivery. The advantage lies mainly in minimum delivery cost, higher content availability, and copyright compliance in exploring P2P network resources.
Authority System to Prevent Privacy Protection in Peer-to-Peer Network System
doi:10.11648/j.ajnc.20130203.13
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
S. Uvaraj
N. Kannaiya Raja
Authority System to Prevent Privacy Protection in Peer-to-Peer Network System
2
3
72
72
2014-01-01
2014-01-01
10.11648/j.ajnc.20130203.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.13
© Science Publishing Group
Performance Evaluation of Cooperative ML-IDMA Communications with DF Protocols
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.11
Relaying and cooperative diversity allow multiple wireless radios to effectively share their antennas and create a virtual antenna array, thereby leveraging the spatial diversity benefits of multiple-input multiple-output antenna systems. In this paper, we consider the bit error rate performance analysis of a cooperative relay communication system on Multi-Layer-IDMA (ML-IDMA) using Maximal-Ratio-Combining (MRC) technique; we examine the effect of layers number on the performance and derive the average bit error probability of the Decode-and-Forward (DF) relay schemes by using the closed-form relay link Signal-to-Noise Ratio (SNR). Based on the analysis, we show that from the simulation results, degradation in the performance is observed when increasing number of layers but on the other hand we saved in the Band Width (BW).
Relaying and cooperative diversity allow multiple wireless radios to effectively share their antennas and create a virtual antenna array, thereby leveraging the spatial diversity benefits of multiple-input multiple-output antenna systems. In this paper, we consider the bit error rate performance analysis of a cooperative relay communication system on Multi-Layer-IDMA (ML-IDMA) using Maximal-Ratio-Combining (MRC) technique; we examine the effect of layers number on the performance and derive the average bit error probability of the Decode-and-Forward (DF) relay schemes by using the closed-form relay link Signal-to-Noise Ratio (SNR). Based on the analysis, we show that from the simulation results, degradation in the performance is observed when increasing number of layers but on the other hand we saved in the Band Width (BW).
Performance Evaluation of Cooperative ML-IDMA Communications with DF Protocols
doi:10.11648/j.ajnc.20130203.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Basma A. Mahmoud
Esam A. A. Hagras
Mohamed A. Abo El-Dhab
Performance Evaluation of Cooperative ML-IDMA Communications with DF Protocols
2
3
61
61
2014-01-01
2014-01-01
10.11648/j.ajnc.20130203.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.11
© Science Publishing Group
Simulation and Evaluation of WIMAX Handover over Homogeneous and Heterogeneous Networks
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.14
Different aspects of wireless networks are changing as a result of the continuous needs in terms of speed, data rates and quality of service. Such aspects are required to be adaptable within the same network or among networks of different technologies and service providers. Consequently, Worldwide Interoperability for Microwave Access (WiMAX) is one of the future generation networks (4G) that needs further study. However, a major consideration for WiMAX to achieve mobility is the handover mechanism that concerns with the mobile station movement within the range of network coverage from one base station to another similar homogeneous or different homogeneous network. In this paper, an intensive analysis to handover mechanism in WiMAX followed by comparisons to WiMAX performance with UMTS and WiFi networks is carried out. QualNet 4.5.1 simulator is used to simulate the comparison process homogeneously and heterogeneously. Performance metrics of Throughput, End-to-End (E-2-E) Delay and Jitter in the comparison during handover process in/between the wireless networks are used. The simulation results are evaluated to identify the performance of the handover process over WiMAX-WiMAX, WiMAX-UMTS and WiMAX-WiFi with respect to the selected metrics. The environment of Wi-MAX-WiMAX has shown substantial enhancement of the system Throughput, reduction of E-2-E Delay and Jitter.
Different aspects of wireless networks are changing as a result of the continuous needs in terms of speed, data rates and quality of service. Such aspects are required to be adaptable within the same network or among networks of different technologies and service providers. Consequently, Worldwide Interoperability for Microwave Access (WiMAX) is one of the future generation networks (4G) that needs further study. However, a major consideration for WiMAX to achieve mobility is the handover mechanism that concerns with the mobile station movement within the range of network coverage from one base station to another similar homogeneous or different homogeneous network. In this paper, an intensive analysis to handover mechanism in WiMAX followed by comparisons to WiMAX performance with UMTS and WiFi networks is carried out. QualNet 4.5.1 simulator is used to simulate the comparison process homogeneously and heterogeneously. Performance metrics of Throughput, End-to-End (E-2-E) Delay and Jitter in the comparison during handover process in/between the wireless networks are used. The simulation results are evaluated to identify the performance of the handover process over WiMAX-WiMAX, WiMAX-UMTS and WiMAX-WiFi with respect to the selected metrics. The environment of Wi-MAX-WiMAX has shown substantial enhancement of the system Throughput, reduction of E-2-E Delay and Jitter.
Simulation and Evaluation of WIMAX Handover over Homogeneous and Heterogeneous Networks
doi:10.11648/j.ajnc.20130203.14
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Anmar Hamid Hameed
Salama A. Mostafa
Mazin Abed Mohammed
Simulation and Evaluation of WIMAX Handover over Homogeneous and Heterogeneous Networks
2
3
80
80
2014-01-01
2014-01-01
10.11648/j.ajnc.20130203.14
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.14
© Science Publishing Group
Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.12
P2P network is the best and popular network sharing of contents by the user through internet. Bloom Cast is an efficient technique used for full-text retrieval scheme in unstructured P2P networks. By using the fullest of a hybrid P2P protocol, Bloom Cast makes copies of the contents in the network uniformly at a random across the P2P networks in order to achieve a guaranteed recall at a communication cost of the network. Bloom Cast model works only when the two constraints are met: 1) the query replicas and document replicas are randomly and uniformly distributed across the P2P network; and 2) every peer knows N, the size of the network. To support random node sampling and network size estimation, Bloom Cast mixes a lightweight DHT into an unstructured P2P network. Further to reduce the replication cost, Bloom Cast utilizes Bloom Filters to encode the entire document. Bloom Cast hybridizes a lightweight DHT with an unstructured P2P overlay to support random node sampling and network size estimation. Since P2P networks are self-configuring networks with minimal or no central control, P2P networks are more vulnerable to malwares, malicious code, viruses, etc., than the traditional client-server networks, due to their lack of structure and unmanaged nature. All peers in a P2P network is identified by its identity certificates (aka identity). The identity here is attached to the repudiation of a given peer. Self-certification helps us to generate the identity certificate, thus here all the peers maintain their own and hence trusted certificate authority which issues the identity certificate to the peer.
P2P network is the best and popular network sharing of contents by the user through internet. Bloom Cast is an efficient technique used for full-text retrieval scheme in unstructured P2P networks. By using the fullest of a hybrid P2P protocol, Bloom Cast makes copies of the contents in the network uniformly at a random across the P2P networks in order to achieve a guaranteed recall at a communication cost of the network. Bloom Cast model works only when the two constraints are met: 1) the query replicas and document replicas are randomly and uniformly distributed across the P2P network; and 2) every peer knows N, the size of the network. To support random node sampling and network size estimation, Bloom Cast mixes a lightweight DHT into an unstructured P2P network. Further to reduce the replication cost, Bloom Cast utilizes Bloom Filters to encode the entire document. Bloom Cast hybridizes a lightweight DHT with an unstructured P2P overlay to support random node sampling and network size estimation. Since P2P networks are self-configuring networks with minimal or no central control, P2P networks are more vulnerable to malwares, malicious code, viruses, etc., than the traditional client-server networks, due to their lack of structure and unmanaged nature. All peers in a P2P network is identified by its identity certificates (aka identity). The identity here is attached to the repudiation of a given peer. Self-certification helps us to generate the identity certificate, thus here all the peers maintain their own and hence trusted certificate authority which issues the identity certificate to the peer.
Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks
doi:10.11648/j.ajnc.20130203.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
E. Mohan
S. Uvaraj
S. Suresh
U. Helen Monisha
N. Kannaiya Raja
Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks
2
3
66
66
2014-01-01
2014-01-01
10.11648/j.ajnc.20130203.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130203.12
© Science Publishing Group
Enhancement of Transient and Steady State Responses of Voltage by Using DVR
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130204.12
Voltage sag is one of the most important power quality problems challenging the utility industry voltage sags can be compensated for by voltage and power injection into the distribution system. Voltage sags are an important power quality problem and Dynamic Voltage Restorer is known as an effective device to mitigate voltage sags .The dynamic voltage restorer has become popular as a cost effective solution for the protection of sensitive loads from voltage sags. Simulations of the dynamic voltage restorer have been proposed at low voltage level; and give an opportunity to protect high power sensitive loads from voltage sags. This paper reports simulation test results obtained on a low voltage level using a dynamic voltage restorer. Dynamic voltage restorer was designed to protect a load from voltage sag. The proposed Dynamic Voltage Restorer obtains good transient and steady state responses.
Voltage sag is one of the most important power quality problems challenging the utility industry voltage sags can be compensated for by voltage and power injection into the distribution system. Voltage sags are an important power quality problem and Dynamic Voltage Restorer is known as an effective device to mitigate voltage sags .The dynamic voltage restorer has become popular as a cost effective solution for the protection of sensitive loads from voltage sags. Simulations of the dynamic voltage restorer have been proposed at low voltage level; and give an opportunity to protect high power sensitive loads from voltage sags. This paper reports simulation test results obtained on a low voltage level using a dynamic voltage restorer. Dynamic voltage restorer was designed to protect a load from voltage sag. The proposed Dynamic Voltage Restorer obtains good transient and steady state responses.
Enhancement of Transient and Steady State Responses of Voltage by Using DVR
doi:10.11648/j.ajnc.20130204.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Jyothilal Nayak Bharothu
D Sunder Singh
Enhancement of Transient and Steady State Responses of Voltage by Using DVR
2
4
111
111
2014-01-01
2014-01-01
10.11648/j.ajnc.20130204.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130204.12
© Science Publishing Group
KVM vs. LXC: Comparing Performance and Isolation of Hardware-assisted Virtual Routers
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130204.11
Concerns have been raised about the performance of PC-based virtual routers as they do packet processing in software. Furthermore, it becomes challenging to maintain isolation among virtual routers due to resource contention in a shared environment. Hardware vendors recognize this issue and PC hardware with virtualization support (SR-IOV and Intel-VTd) has been introduced in recent years. In this paper, we investigate how such hardware features can be integrated with two different virtualization technologies (LXC and KVM) to enhance performance and isolation of virtual routers on shared environments. We compare LXC and KVM and our results indicate that KVM in combination with hardware support can provide better trade-offs between performance and isolation. We notice that KVM has slightly lower throughput, but has superior isolation properties by providing more explicit control of CPU resources. We demonstrate that KVM allows defining a CPU share for a virtual router, something that is difficult to achieve in LXC, where packet forwarding is done in a kernel shared by all virtual routers.
Concerns have been raised about the performance of PC-based virtual routers as they do packet processing in software. Furthermore, it becomes challenging to maintain isolation among virtual routers due to resource contention in a shared environment. Hardware vendors recognize this issue and PC hardware with virtualization support (SR-IOV and Intel-VTd) has been introduced in recent years. In this paper, we investigate how such hardware features can be integrated with two different virtualization technologies (LXC and KVM) to enhance performance and isolation of virtual routers on shared environments. We compare LXC and KVM and our results indicate that KVM in combination with hardware support can provide better trade-offs between performance and isolation. We notice that KVM has slightly lower throughput, but has superior isolation properties by providing more explicit control of CPU resources. We demonstrate that KVM allows defining a CPU share for a virtual router, something that is difficult to achieve in LXC, where packet forwarding is done in a kernel shared by all virtual routers.
KVM vs. LXC: Comparing Performance and Isolation of Hardware-assisted Virtual Routers
doi:10.11648/j.ajnc.20130204.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Muhammad Siraj Rathore
Markus Hidel
Peter Sjödin
KVM vs. LXC: Comparing Performance and Isolation of Hardware-assisted Virtual Routers
2
4
96
96
2014-01-01
2014-01-01
10.11648/j.ajnc.20130204.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130204.11
© Science Publishing Group
Robust Cellular Network for Rural Telephony in Southern Nigeria
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130205.12
The paper identifies the state of telecommunication’s services and its growth cum economic relevance in Nigeria, while proffering a cost-effective and less problematic telephone network that is readily affordable and available to the poverty-stricken populace predominant in rural areas. The design and implementation of an efficient, robust network based on existing Global Satellite for Mobile communication) cum Code Division Multiple Access, as means to cater and provide for telecommunications in rural Delta State in Nigeria. A major hinderance to the provision of such services/facilities in rural area for decades, has been the high operational cost and little profit margins. Thus, the robust network aims to create an effective, affordable option for such rural and semi-urban settler; while on the part of operators, a system with minimal cost to implement, deploy and maintain for Delta State Senatorial District in Delta State, Nigeria, is used as the case study to test-run the analysis and design of such a novel cellular network.
The paper identifies the state of telecommunication’s services and its growth cum economic relevance in Nigeria, while proffering a cost-effective and less problematic telephone network that is readily affordable and available to the poverty-stricken populace predominant in rural areas. The design and implementation of an efficient, robust network based on existing Global Satellite for Mobile communication) cum Code Division Multiple Access, as means to cater and provide for telecommunications in rural Delta State in Nigeria. A major hinderance to the provision of such services/facilities in rural area for decades, has been the high operational cost and little profit margins. Thus, the robust network aims to create an effective, affordable option for such rural and semi-urban settler; while on the part of operators, a system with minimal cost to implement, deploy and maintain for Delta State Senatorial District in Delta State, Nigeria, is used as the case study to test-run the analysis and design of such a novel cellular network.
Robust Cellular Network for Rural Telephony in Southern Nigeria
doi:10.11648/j.ajnc.20130205.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
A. A. Ojugo.
R. E. Yoro.
D. Oyemade.
M. O. Yerokun.
A. O. Eboka
E. Ugboh
F. O. Aghware
Robust Cellular Network for Rural Telephony in Southern Nigeria
2
5
132
132
2014-01-01
2014-01-01
10.11648/j.ajnc.20130205.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130205.12
© Science Publishing Group
Performance Modeling of Parallel Computers NOW and Grid
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130205.11
The paper describes development, realization and verification of more precise analytical models for the study of the basic performance parameters of parallel computers based on connected parallel computers (Cluster, NOW, Grid). At first the paper describes very shortly the developing steps of parallel computer architecture and then he summarized the basic concepts for performance modeling of mentioned parallel computers. To illustrate theoretical evaluation concepts the paper considers in its experimental part the achieved results on concrete analyzed examples and their comparison. The suggested model considers for every node of the NOW or Grid networks one part for the own workstation’s activities and another one for node’s communication channel modeling of performed data communications. In case of using multiprocessor system, as modern node’s communication processor, the suggested model considers for own node’s activities M/D/m queuing theory system and for every node’s communication channel M/D/1 system. Based on these more realistic assumptions we have been developed improved analytical models to account the real no exponential nature of the inputs to the modeling queuing systems. The achieved results of the developed models were compared with the results of the common used analytical and simulation model to estimate the magnitude of their improvement. The developed analytical models could be used under various ranges of input analytical parameters, which influence the architecture of NOW or Grid computer networks and which are interested from the sight of practical using. These consequences are in relation to the developed analytical models and their verifications through simulation model.
The paper describes development, realization and verification of more precise analytical models for the study of the basic performance parameters of parallel computers based on connected parallel computers (Cluster, NOW, Grid). At first the paper describes very shortly the developing steps of parallel computer architecture and then he summarized the basic concepts for performance modeling of mentioned parallel computers. To illustrate theoretical evaluation concepts the paper considers in its experimental part the achieved results on concrete analyzed examples and their comparison. The suggested model considers for every node of the NOW or Grid networks one part for the own workstation’s activities and another one for node’s communication channel modeling of performed data communications. In case of using multiprocessor system, as modern node’s communication processor, the suggested model considers for own node’s activities M/D/m queuing theory system and for every node’s communication channel M/D/1 system. Based on these more realistic assumptions we have been developed improved analytical models to account the real no exponential nature of the inputs to the modeling queuing systems. The achieved results of the developed models were compared with the results of the common used analytical and simulation model to estimate the magnitude of their improvement. The developed analytical models could be used under various ranges of input analytical parameters, which influence the architecture of NOW or Grid computer networks and which are interested from the sight of practical using. These consequences are in relation to the developed analytical models and their verifications through simulation model.
Performance Modeling of Parallel Computers NOW and Grid
doi:10.11648/j.ajnc.20130205.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Peter Hanuliak
Michal Hanuliak
Performance Modeling of Parallel Computers NOW and Grid
2
5
124
124
2014-01-01
2014-01-01
10.11648/j.ajnc.20130205.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130205.11
© Science Publishing Group
Authority Ring Periodically Load Collection for Load Balancing of Cluster System
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130205.13
Now a day clusters are more popular because of their parallel processing and super computing capabilities. Generally complicated processes needs more amount of time to run on single processor but same can give quick result on clusters because of their parallel execution capabilities due to their compute nodes. Typically this performance depends on which load balancing algorithm is running on the clustered system. The parallel programming on the cluster can achieve through massage passing interface or application programming interface (API). Though the load balancing algorithm distributing load among the compute nodes of the clusters, it needs parallel programming, hence MPI library plays very important role to build new load balancing algorithm. The workload on a cluster system can be highly variable, increasing the difficulty of balancing the load across its compute nodes. This paper proposes new dynamic load balancing algorithm, which is implemented on Rock cluster and maximum time it gives the better performance as compares with previous dynamic load balancing algorithm.
Now a day clusters are more popular because of their parallel processing and super computing capabilities. Generally complicated processes needs more amount of time to run on single processor but same can give quick result on clusters because of their parallel execution capabilities due to their compute nodes. Typically this performance depends on which load balancing algorithm is running on the clustered system. The parallel programming on the cluster can achieve through massage passing interface or application programming interface (API). Though the load balancing algorithm distributing load among the compute nodes of the clusters, it needs parallel programming, hence MPI library plays very important role to build new load balancing algorithm. The workload on a cluster system can be highly variable, increasing the difficulty of balancing the load across its compute nodes. This paper proposes new dynamic load balancing algorithm, which is implemented on Rock cluster and maximum time it gives the better performance as compares with previous dynamic load balancing algorithm.
Authority Ring Periodically Load Collection for Load Balancing of Cluster System
doi:10.11648/j.ajnc.20130205.13
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Sharada Santosh Patil
Arpita N. Gopal
Authority Ring Periodically Load Collection for Load Balancing of Cluster System
2
5
139
139
2014-01-01
2014-01-01
10.11648/j.ajnc.20130205.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130205.13
© Science Publishing Group
An Improved DCA and Channel Modelling Algorithm Based on Carrier Priority in LTE/LTE-A
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130206.12
Dynamic Channel Allocation (DCA) technology is an effective ways to solve the contradiction between limited spectrum resources and increasing user demand in TD-SCDMA system. Aiming at the limitation of conventional DCA algorithm, an improved dynamic channel allocation algorithm based on carrier priority is proposed in this paper to solve tidal phenomenon caused by regional traffic migration and shows channel model. The simulation results show that the proposed algorithm can effectively increase resource utilization and improve access success rate with less changing in channel model.
Dynamic Channel Allocation (DCA) technology is an effective ways to solve the contradiction between limited spectrum resources and increasing user demand in TD-SCDMA system. Aiming at the limitation of conventional DCA algorithm, an improved dynamic channel allocation algorithm based on carrier priority is proposed in this paper to solve tidal phenomenon caused by regional traffic migration and shows channel model. The simulation results show that the proposed algorithm can effectively increase resource utilization and improve access success rate with less changing in channel model.
An Improved DCA and Channel Modelling Algorithm Based on Carrier Priority in LTE/LTE-A
doi:10.11648/j.ajnc.20130206.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Amirhossein Fereidountabar
An Improved DCA and Channel Modelling Algorithm Based on Carrier Priority in LTE/LTE-A
2
6
154
154
2014-01-01
2014-01-01
10.11648/j.ajnc.20130206.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130206.12
© Science Publishing Group
Working with TCP\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\IP Based Network Monitoring System Using Linux
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130206.11
Nagios is a stable, scalable and extensible enterprise-class network and system monitoring tool which allows administrators to monitor network and host resources such as HTTP, SMTP, POP3, disk usage and processor load. Originally Nagios was designed to run under Linux, but it can also be used on several UNIX o132perating systems. This chapter covers the installation and parts of the configuration of Nagios. The purpose of this paper is not only to introduce to everyone the concept of distributed monitoring with Nagios but capturing the beauty of it to improve the security of computer networks. Firstly, an introduction to Nagios will be discussed to provide readers a brief overview of what Nagios is. Next, it will discuss how distributed network monitoring is an essential part to information security. It will then proceed to introducing the requirements needed to build a distributed Nagios network monitoring environment and demonstrate how Nagios can be configured to construct a distributed monitoring environment that helps improve the state of security of distributed networks. In essence, companies hould be aware of the need for hiring specialized security analysts to perform round-the-clock systems monitoring to secure their resources.
Nagios is a stable, scalable and extensible enterprise-class network and system monitoring tool which allows administrators to monitor network and host resources such as HTTP, SMTP, POP3, disk usage and processor load. Originally Nagios was designed to run under Linux, but it can also be used on several UNIX o132perating systems. This chapter covers the installation and parts of the configuration of Nagios. The purpose of this paper is not only to introduce to everyone the concept of distributed monitoring with Nagios but capturing the beauty of it to improve the security of computer networks. Firstly, an introduction to Nagios will be discussed to provide readers a brief overview of what Nagios is. Next, it will discuss how distributed network monitoring is an essential part to information security. It will then proceed to introducing the requirements needed to build a distributed Nagios network monitoring environment and demonstrate how Nagios can be configured to construct a distributed monitoring environment that helps improve the state of security of distributed networks. In essence, companies hould be aware of the need for hiring specialized security analysts to perform round-the-clock systems monitoring to secure their resources.
Working with TCP\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\IP Based Network Monitoring System Using Linux
doi:10.11648/j.ajnc.20130206.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Diponkar Paul
Shamsuddin Majamder
Working with TCP\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\IP Based Network Monitoring System Using Linux
2
6
148
148
2014-01-01
2014-01-01
10.11648/j.ajnc.20130206.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20130206.11
© Science Publishing Group
Unified Analytical Models of Parallel and Distributed Computing
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140301.11
The optimal resource allocation satisfies the needed capacity of the used resources. To such analysis we can use both analytical and simulation methods. Principally analytical methods (AM) belong to the preferred method in comparison to the simulation method, because of their potential ability of more general analysis and also of ability to analyze massive parallel computers. This article goes further in developing AM based on queuing theory results in relation to our published paper in [9]. The extensions are in extending derived AM to whole range of parallel computers and also to sum up public acceptance of our published paper. The article therefore describes deriving of correction factor of standard AM based on M/M/m and M/M/1queuing theory systems. In detail the paper describes derivation of a correction factor for standard AM to study more precise their performance. The paper contributions are in unified AM and in deriving correction factor in order to take into account real non-exponential nature of the inputs to the computing nodes and node’s communication channels. The derived analytical results were compared with performed simulation results in order to estimate the magnitude of improvement. Likewise the corrected AM were tested under various ranges of parameters, which influence the architecture of the parallel computers and its communication networks too. These results are very important in practical use.
The optimal resource allocation satisfies the needed capacity of the used resources. To such analysis we can use both analytical and simulation methods. Principally analytical methods (AM) belong to the preferred method in comparison to the simulation method, because of their potential ability of more general analysis and also of ability to analyze massive parallel computers. This article goes further in developing AM based on queuing theory results in relation to our published paper in [9]. The extensions are in extending derived AM to whole range of parallel computers and also to sum up public acceptance of our published paper. The article therefore describes deriving of correction factor of standard AM based on M/M/m and M/M/1queuing theory systems. In detail the paper describes derivation of a correction factor for standard AM to study more precise their performance. The paper contributions are in unified AM and in deriving correction factor in order to take into account real non-exponential nature of the inputs to the computing nodes and node’s communication channels. The derived analytical results were compared with performed simulation results in order to estimate the magnitude of improvement. Likewise the corrected AM were tested under various ranges of parameters, which influence the architecture of the parallel computers and its communication networks too. These results are very important in practical use.
Unified Analytical Models of Parallel and Distributed Computing
doi:10.11648/j.ajnc.20140301.11
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Michal Hanuliak
Unified Analytical Models of Parallel and Distributed Computing
3
1
12
12
2014-01-01
2014-01-01
10.11648/j.ajnc.20140301.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140301.11
© Science Publishing Group
Social Interactions and Query Analysis in an Online Forum
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140301.12
Online social networks (forum) have become extremely popular; numerous sites allow users to interact and share content using social links observing that there are some limitations on most of the social interaction networks. A recent study has demonstrated that the “strength of ties” varies widely, ranging from pairs of users who are best friends to pairs of users who even wished they weren’t friends. In order to distinguish between these strong and weak links, researchers have suggested examining the activity networks, the network that is formed by users who actually interact using one or many of the methods provided by the social networking site. Also for effective study, we collect data on both friendship relationship and interactions for a large subset of the Facebook social network and forum, Twitter, 2go, m.eskimi and other social interactive networks. From a technological standpoint, forums or boards are web applications managing user-generated content. Early Internet forums could be described as a web version of an electronic mailing list or newsgroup (such as exist on Usenet); allowing people to post messages and comment on other messages. It has been discovered that Chat forum is one of the newest way in which organization and the business world use now to reach out to their numerous customers in order to get feedback and responses concerning its entire product lines to share of their opinion.
Online social networks (forum) have become extremely popular; numerous sites allow users to interact and share content using social links observing that there are some limitations on most of the social interaction networks. A recent study has demonstrated that the “strength of ties” varies widely, ranging from pairs of users who are best friends to pairs of users who even wished they weren’t friends. In order to distinguish between these strong and weak links, researchers have suggested examining the activity networks, the network that is formed by users who actually interact using one or many of the methods provided by the social networking site. Also for effective study, we collect data on both friendship relationship and interactions for a large subset of the Facebook social network and forum, Twitter, 2go, m.eskimi and other social interactive networks. From a technological standpoint, forums or boards are web applications managing user-generated content. Early Internet forums could be described as a web version of an electronic mailing list or newsgroup (such as exist on Usenet); allowing people to post messages and comment on other messages. It has been discovered that Chat forum is one of the newest way in which organization and the business world use now to reach out to their numerous customers in order to get feedback and responses concerning its entire product lines to share of their opinion.
Social Interactions and Query Analysis in an Online Forum
doi:10.11648/j.ajnc.20140301.12
American Journal of Networks and Communications
2014-01-01
© Science Publishing Group
Oladosu Olakunle Abimbola
Okikiola Folasade Mercy
Alakiri Harrison Osarenren
Oladiboye Olasunkanmi Esther
Social Interactions and Query Analysis in an Online Forum
3
1
16
16
2014-01-01
2014-01-01
10.11648/j.ajnc.20140301.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140301.12
© Science Publishing Group
Sideband Noise Mitigation in a Co-Located Network Involving CDMA2000 and WCDMA System
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140302.11
The installation of base station antennas within close frequency range in a co-located scenario constitutes a major interference for radio spectrum engineers. In a co-located setting involving a downlink frequency of CDMA2000 (1960 -1990MHz) and an uplink frequency of WCDMA (1920-1980MHz) as used in the telecommunication industry in Nigeria, the base station receiver is required to receive low amplitude desired signals in the presence of strong transmitting power signals resulting to sideband noise interference. The paper identifies the major mechanism of the sideband noise and proposes the application of a Butterworth Band Pass Filter (BBPF) as a mitigation technique. The technique was developed through the applications of empirical and mathematical analysis conducted in two different scenarios to evaluate the levels of the interference signals on the WCDMA receiver from CDMA2000 transmitter. The first scenario involved a standalone un-collocated WCDMA network while the second scenario involved a co-located network (CDMA2000 and WCDMA). A 52dB required attenuation specification was obtained for the BBPF design.
The installation of base station antennas within close frequency range in a co-located scenario constitutes a major interference for radio spectrum engineers. In a co-located setting involving a downlink frequency of CDMA2000 (1960 -1990MHz) and an uplink frequency of WCDMA (1920-1980MHz) as used in the telecommunication industry in Nigeria, the base station receiver is required to receive low amplitude desired signals in the presence of strong transmitting power signals resulting to sideband noise interference. The paper identifies the major mechanism of the sideband noise and proposes the application of a Butterworth Band Pass Filter (BBPF) as a mitigation technique. The technique was developed through the applications of empirical and mathematical analysis conducted in two different scenarios to evaluate the levels of the interference signals on the WCDMA receiver from CDMA2000 transmitter. The first scenario involved a standalone un-collocated WCDMA network while the second scenario involved a co-located network (CDMA2000 and WCDMA). A 52dB required attenuation specification was obtained for the BBPF design.
Sideband Noise Mitigation in a Co-Located Network Involving CDMA2000 and WCDMA System
doi:10.11648/j.ajnc.20140302.11
American Journal of Networks and Communications
2014-05-19
© Science Publishing Group
Nosiri Onyebuchi Chikezie
Onoh Gregory Nwachukwu
Chukwudebe Gloria Azogini
Azubogu Austin Chukwuemeka
Sideband Noise Mitigation in a Co-Located Network Involving CDMA2000 and WCDMA System
3
2
24
24
2014-05-19
2014-05-19
10.11648/j.ajnc.20140302.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140302.11
© Science Publishing Group
Analysis of the Automatic Transmission Fault Diagnosis Based on Bayesian Network Sensitivity
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140302.12
Automobile automatic transmission is a complex system integrates machine, electricity, liquid, in terms of its fault diagnosis has the characteristics of uncertainty and high complex correlation, thus put forward the Bayesian network based on the theory of probability and theory of the fault tree for fault diagnosis methods of automobile automatic transmission, it has a certain value for application. Take a failure automatic transmission as an example, analyzes the causes of the automatic transmission fault and the relationship between the affecting factors, according to the properties of the automatic transmission fault establishes a Bayesian network model, and through calculating sensitivity to determine the probability of a certain causes to the automatic transmission fault. The results show that the method is operable in automatic transmission fault diagnosis, diagnosis results are accurate and credible.
Automobile automatic transmission is a complex system integrates machine, electricity, liquid, in terms of its fault diagnosis has the characteristics of uncertainty and high complex correlation, thus put forward the Bayesian network based on the theory of probability and theory of the fault tree for fault diagnosis methods of automobile automatic transmission, it has a certain value for application. Take a failure automatic transmission as an example, analyzes the causes of the automatic transmission fault and the relationship between the affecting factors, according to the properties of the automatic transmission fault establishes a Bayesian network model, and through calculating sensitivity to determine the probability of a certain causes to the automatic transmission fault. The results show that the method is operable in automatic transmission fault diagnosis, diagnosis results are accurate and credible.
Analysis of the Automatic Transmission Fault Diagnosis Based on Bayesian Network Sensitivity
doi:10.11648/j.ajnc.20140302.12
American Journal of Networks and Communications
2014-06-23
© Science Publishing Group
Luo Jin
Ma Qihua
Luo Yiping
Analysis of the Automatic Transmission Fault Diagnosis Based on Bayesian Network Sensitivity
3
2
28
28
2014-06-23
2014-06-23
10.11648/j.ajnc.20140302.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140302.12
© Science Publishing Group
Analysis of Effectiveness of Communication Overheads in the Parallel Computing System Using Stochastic Colored Petri Nets
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140303.11
In architectures of parallel computing system, which has a large number of processing nodes, communication overhead is an important metric to evaluate and minimize by improving computation speedup solutions. In this paper, we propose using Stochastic Colored Petri Net to give models of parallel computing multi-processing systems for analyzing and evaluating effectiveness of communication overheads to system performance.
In architectures of parallel computing system, which has a large number of processing nodes, communication overhead is an important metric to evaluate and minimize by improving computation speedup solutions. In this paper, we propose using Stochastic Colored Petri Net to give models of parallel computing multi-processing systems for analyzing and evaluating effectiveness of communication overheads to system performance.
Analysis of Effectiveness of Communication Overheads in the Parallel Computing System Using Stochastic Colored Petri Nets
doi:10.11648/j.ajnc.20140303.11
American Journal of Networks and Communications
2014-07-24
© Science Publishing Group
Nguyen Minh Quy
Huynh Quyet Thang
Ho Khanh Lam
Analysis of Effectiveness of Communication Overheads in the Parallel Computing System Using Stochastic Colored Petri Nets
3
3
38
38
2014-07-24
2014-07-24
10.11648/j.ajnc.20140303.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140303.11
© Science Publishing Group
Optimal Power Allocation and Power Constraint in OFDM-Based Cognitive Radio Systems
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140304.11
Cognitive Radio (CR), which aims to improve spectrum utilization by accessing the spectrum originally licensed to a primary system, is a promising concept. In cognitive radio system based on orthogonal frequency division multiplexing (OFDM), the optimized algorithms for sub-carrier power allocation share the problems of complex iterative calculation and difficult realization. In this case, a sub-optimal power allocation algorithm based on power function distribution is proposed, to allocate power of in-band subcarrier of cognitive user according to the numerical characteristics of the power function by using a convex optimization numerical method under linear constraint. This algorithm has the advantages of fast calculation speed and easy realization, and reduces the interference for the authorized user brought by the power leakage of the in-band subcarrier of cognitive user appears in the out-of-band. MALAB simulation results show that the proposed scheme maximizes the in-band channel capacity of the cognitive user under the interference threshold of the authorized user and the comparison model the optimal relationship between the limited and unlimited transmit power capacity. Meanwhile, the maximum transmission rate of the existing power allocation scheme is increased within the same condition.
Cognitive Radio (CR), which aims to improve spectrum utilization by accessing the spectrum originally licensed to a primary system, is a promising concept. In cognitive radio system based on orthogonal frequency division multiplexing (OFDM), the optimized algorithms for sub-carrier power allocation share the problems of complex iterative calculation and difficult realization. In this case, a sub-optimal power allocation algorithm based on power function distribution is proposed, to allocate power of in-band subcarrier of cognitive user according to the numerical characteristics of the power function by using a convex optimization numerical method under linear constraint. This algorithm has the advantages of fast calculation speed and easy realization, and reduces the interference for the authorized user brought by the power leakage of the in-band subcarrier of cognitive user appears in the out-of-band. MALAB simulation results show that the proposed scheme maximizes the in-band channel capacity of the cognitive user under the interference threshold of the authorized user and the comparison model the optimal relationship between the limited and unlimited transmit power capacity. Meanwhile, the maximum transmission rate of the existing power allocation scheme is increased within the same condition.
Optimal Power Allocation and Power Constraint in OFDM-Based Cognitive Radio Systems
doi:10.11648/j.ajnc.20140304.11
American Journal of Networks and Communications
2014-09-29
© Science Publishing Group
Nguyen Van Vinh
Pham Ngoc Thang
Optimal Power Allocation and Power Constraint in OFDM-Based Cognitive Radio Systems
3
4
55
55
2014-09-29
2014-09-29
10.11648/j.ajnc.20140304.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140304.11
© Science Publishing Group
Signal Shaping to Achieve OOK and PSK Co-Existence for Improved Optical Access Network Performance
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140304.12
This paper proposes a novel symbol mapping that uses signal shaping to alleviate the BER problem in constellation sharing with the use of phase information. This mapping solves one of the most critical problems; the small Euclid distance of the PSK symbols in the constellation sharing of OOK and PSK in Passive Optical Networks (PONs). Constellation sharing enables next generation PONs to overlay existing PONs with the use of an advanced modulation format based on the Digital Signal Processing (DSP) technology that well supports migration of the access network. The modulation format of Amplitude Shift Keying (ASK), Phase Shift Keying (PSK), and Quadrature Amplitude Modulation (QAM) can co-exist with the existing PONs, which utilize On-off Keying (OOK). The proposed mapping is designed to maximize the symbol distance assuming the co-existence of OOK and PSK. This paper shows the configuration, operation principles, and performance of the proposed signal mapping for OOK and PSK. It also shows that constellation sharing improves the BER characteristics of OOK and PSK in conjunction with an existing PON and the next generation technology.
This paper proposes a novel symbol mapping that uses signal shaping to alleviate the BER problem in constellation sharing with the use of phase information. This mapping solves one of the most critical problems; the small Euclid distance of the PSK symbols in the constellation sharing of OOK and PSK in Passive Optical Networks (PONs). Constellation sharing enables next generation PONs to overlay existing PONs with the use of an advanced modulation format based on the Digital Signal Processing (DSP) technology that well supports migration of the access network. The modulation format of Amplitude Shift Keying (ASK), Phase Shift Keying (PSK), and Quadrature Amplitude Modulation (QAM) can co-exist with the existing PONs, which utilize On-off Keying (OOK). The proposed mapping is designed to maximize the symbol distance assuming the co-existence of OOK and PSK. This paper shows the configuration, operation principles, and performance of the proposed signal mapping for OOK and PSK. It also shows that constellation sharing improves the BER characteristics of OOK and PSK in conjunction with an existing PON and the next generation technology.
Signal Shaping to Achieve OOK and PSK Co-Existence for Improved Optical Access Network Performance
doi:10.11648/j.ajnc.20140304.12
American Journal of Networks and Communications
2014-10-18
© Science Publishing Group
Yasuyuki Okumura
Maki Kato
Katsuyuki Fujii
Signal Shaping to Achieve OOK and PSK Co-Existence for Improved Optical Access Network Performance
3
4
62
62
2014-10-18
2014-10-18
10.11648/j.ajnc.20140304.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140304.12
© Science Publishing Group
Effects and Optimization Impact of Wireless Signal Loss for Subscribers in Lagos State
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140305.11
This paper presents the effects and optimization impact of wireless signal loss for subscribers in Lagos state, using 3G as a study. This paper is aimed at analyzing network coverage data obtained through drive testing on the investigated area to detect coverage holes or area with poor coverage. The collected data showed significantly where the problems were via pre drive test and analysis was performed to proffer solutions to identified problems. This was later confirmed with a post drive test. The Key Performance Indicators (KPI) which include Receive Signal Code Power(RSCP), Energy per chip to noise ratio(Ec/No), Speech Quality Index(SQI), User Equipment Transmit Power(UE Tx Power), Active Set number of members were analyzed and showed significant improvement after optimization where necessary. The RSCP coverage quality showed an appreciable improvement from 40% to over 76% of good coverage after optimization. Results after the optimization reveals that the Call Setup Success Rate increased from about 96% to about 98% and the Call Drop Rate reduced from 0.664% to 0.62 % out of 940 and 493 total number of calls attempts made during the pre and post drive test respectively. Besides, areas with more than three active set which could result into pilot pollution were identified and corrected by adjusting of the parameter (tilt) of the antenna involved.
This paper presents the effects and optimization impact of wireless signal loss for subscribers in Lagos state, using 3G as a study. This paper is aimed at analyzing network coverage data obtained through drive testing on the investigated area to detect coverage holes or area with poor coverage. The collected data showed significantly where the problems were via pre drive test and analysis was performed to proffer solutions to identified problems. This was later confirmed with a post drive test. The Key Performance Indicators (KPI) which include Receive Signal Code Power(RSCP), Energy per chip to noise ratio(Ec/No), Speech Quality Index(SQI), User Equipment Transmit Power(UE Tx Power), Active Set number of members were analyzed and showed significant improvement after optimization where necessary. The RSCP coverage quality showed an appreciable improvement from 40% to over 76% of good coverage after optimization. Results after the optimization reveals that the Call Setup Success Rate increased from about 96% to about 98% and the Call Drop Rate reduced from 0.664% to 0.62 % out of 940 and 493 total number of calls attempts made during the pre and post drive test respectively. Besides, areas with more than three active set which could result into pilot pollution were identified and corrected by adjusting of the parameter (tilt) of the antenna involved.
Effects and Optimization Impact of Wireless Signal Loss for Subscribers in Lagos State
doi:10.11648/j.ajnc.20140305.11
American Journal of Networks and Communications
2014-10-22
© Science Publishing Group
Akinyemi Lateef Adesola
Shoewu Oluwagbemiga Omotayo
Makanjuola Najeem Tunji
Ajasa Abiodun Afis
Folorunso Comfort Oluwaseyi
Raji Afis Omogbolahan
Effects and Optimization Impact of Wireless Signal Loss for Subscribers in Lagos State
3
5
72
72
2014-10-22
2014-10-22
10.11648/j.ajnc.20140305.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140305.11
© Science Publishing Group
Complex Performance Modeling of Parallel Algorithms
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.12
Parallel principles are the most effective way how to increase parallel computer performance and parallel algorithms (PA) too. In this sense the paper is devoted to a complex performance evaluation of chosen PA. At first the paper describes very shortly PA and then it summarized basic concepts for performance evaluation of PA. To illustrate the analyzed evaluation concepts the paper considers in its experimental part the results for real analyzed examples of discrete fast Fourier transform (DFFT). These illustration examples we have chosen first due to its wide application in scientific and engineering fields and second from its representation of similar group of PA. The basic form of parallel DFFT is the one-dimensional (1-D), unordered, radix–2 algorithm which uses divide and conquer strategy for its parallel computation. Effective PA of DFFT tends to computing one – dimensional FFT with radix greater than two and computing multidimensional FFT by using the polynomial transfer methods. In general radix - q DFFT is computed by splitting the input sequence of size s into q sequences each of them in size n/q, computing faster their q smaller DFFT’s, and then combining the results. So we do it for actually dominant asynchronous parallel computers based on Network of workstations (NOW) and Grid systems.
Parallel principles are the most effective way how to increase parallel computer performance and parallel algorithms (PA) too. In this sense the paper is devoted to a complex performance evaluation of chosen PA. At first the paper describes very shortly PA and then it summarized basic concepts for performance evaluation of PA. To illustrate the analyzed evaluation concepts the paper considers in its experimental part the results for real analyzed examples of discrete fast Fourier transform (DFFT). These illustration examples we have chosen first due to its wide application in scientific and engineering fields and second from its representation of similar group of PA. The basic form of parallel DFFT is the one-dimensional (1-D), unordered, radix–2 algorithm which uses divide and conquer strategy for its parallel computation. Effective PA of DFFT tends to computing one – dimensional FFT with radix greater than two and computing multidimensional FFT by using the polynomial transfer methods. In general radix - q DFFT is computed by splitting the input sequence of size s into q sequences each of them in size n/q, computing faster their q smaller DFFT’s, and then combining the results. So we do it for actually dominant asynchronous parallel computers based on Network of workstations (NOW) and Grid systems.
Complex Performance Modeling of Parallel Algorithms
doi:10.11648/j.ajnc.s.2014030501.12
American Journal of Networks and Communications
2014-07-31
© Science Publishing Group
Peter Hanuliak
Juraj Hanuliak
Complex Performance Modeling of Parallel Algorithms
3
5
28
28
2014-07-31
2014-07-31
10.11648/j.ajnc.s.2014030501.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.12
© Science Publishing Group
Complex Modeling of Matrix Parallel Algorithms
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.11
Parallel principles are the most effective way how to increase performance in parallel computing (parallel computers and algorithms too). In this sense the paper is devoted to a complex performance evaluation of matrix parallel algorithms (MPA). At first the paper describes the typical matrix parallel algorithms and then it summarizes common properties of them to complex performance modeling of MPA. To complex performance analysis we are able to take into account all overheads influence performance of parallel algorithms (parallel computer architecture, parallel computation, communication etc.). To be le to analyze MPA in their abstract form we have defined needed decomposition models of MPA. For these decomposition strategies we derived analytical relation for defined complex performance criterions including isoefficiency functions, which allow us to predict performance although for hypothetical parallel computer. In its experimental part the paper considers the achieved results using defined complex performance criterions including issoefficiency function for performance prediction also for hypothetical future parallel computers. Such idea of common abstract analysis could be very useful in deriving complex performance criterions for groups of other similar parallel algorithms (PA) as for example numerical integration PA, optimization PA etc.
Parallel principles are the most effective way how to increase performance in parallel computing (parallel computers and algorithms too). In this sense the paper is devoted to a complex performance evaluation of matrix parallel algorithms (MPA). At first the paper describes the typical matrix parallel algorithms and then it summarizes common properties of them to complex performance modeling of MPA. To complex performance analysis we are able to take into account all overheads influence performance of parallel algorithms (parallel computer architecture, parallel computation, communication etc.). To be le to analyze MPA in their abstract form we have defined needed decomposition models of MPA. For these decomposition strategies we derived analytical relation for defined complex performance criterions including isoefficiency functions, which allow us to predict performance although for hypothetical parallel computer. In its experimental part the paper considers the achieved results using defined complex performance criterions including issoefficiency function for performance prediction also for hypothetical future parallel computers. Such idea of common abstract analysis could be very useful in deriving complex performance criterions for groups of other similar parallel algorithms (PA) as for example numerical integration PA, optimization PA etc.
Complex Modeling of Matrix Parallel Algorithms
doi:10.11648/j.ajnc.s.2014030501.11
American Journal of Networks and Communications
2014-07-31
© Science Publishing Group
Peter Hanuliak
Complex Modeling of Matrix Parallel Algorithms
3
5
14
14
2014-07-31
2014-07-31
10.11648/j.ajnc.s.2014030501.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.11
© Science Publishing Group
Decomposition Models of Parallel Algorithms
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.16
The article is devoted to the important role of decomposition strategy in parallel computing (parallel computers, parallel algorithms). The influence of decomposition model to performance in parallel computing we have illustrated on the chosen illustrative examples and that are parallel algorithms (PA) for numerical integration and matrix multiplication. On the basis of the done analysis of the used parallel computers in the world these are divided to the two basic groups which are from the programmer-developer point of view very different. They are also introduced the typical principal structures for both these groups of parallel computers and also their models. The paper then in an illustrative way describes the development of concrete parallel algorithm for matrix multiplication on various parallel systems. For each individual practical implementation of matrix multiplication there is introduced the derivation of its calculation complexity. The described individual ways of developing parallel matrix multiplication and their implementations are compared, analyzed and discussed from sight of programmer-developer and user in order to show the very important role of decomposition strategies mainly at the class of asynchronous parallel computers.
The article is devoted to the important role of decomposition strategy in parallel computing (parallel computers, parallel algorithms). The influence of decomposition model to performance in parallel computing we have illustrated on the chosen illustrative examples and that are parallel algorithms (PA) for numerical integration and matrix multiplication. On the basis of the done analysis of the used parallel computers in the world these are divided to the two basic groups which are from the programmer-developer point of view very different. They are also introduced the typical principal structures for both these groups of parallel computers and also their models. The paper then in an illustrative way describes the development of concrete parallel algorithm for matrix multiplication on various parallel systems. For each individual practical implementation of matrix multiplication there is introduced the derivation of its calculation complexity. The described individual ways of developing parallel matrix multiplication and their implementations are compared, analyzed and discussed from sight of programmer-developer and user in order to show the very important role of decomposition strategies mainly at the class of asynchronous parallel computers.
Decomposition Models of Parallel Algorithms
doi:10.11648/j.ajnc.s.2014030501.16
American Journal of Networks and Communications
2014-07-31
© Science Publishing Group
Michal Hanuliak
Juraj Hanuliak
Decomposition Models of Parallel Algorithms
3
5
84
84
2014-07-31
2014-07-31
10.11648/j.ajnc.s.2014030501.16
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.16
© Science Publishing Group
Modeling of Single Computing Nodes of Parallel Computers
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.15
The paper describes analytical modeling for single computing nodes of parallel computers. At first the paper describes very shortly the developing steps of parallel computer architectures and then he summarized the basic concepts for performance evaluation. To illustrate theoretical evaluation concepts the paper considers in its experimental part the achieved results on concrete analyzed examples and their comparison. The suggested analytical models consider for single computing node based on processor or core and SMP modeling of own computer node´s activities and node´s communication channels of performed data communications within computing node queuing theory systems M/D/m or M/D/. In case of using SMP parallel system as node computer the suggested models consider for own node’s activities M/M/m or M/D/m queuing theory systems. Although we are able to use other more complicated queuing theory systems we prefer modeling with mentioned models because achieved results for these models we can use in decomposed modeling of coupled computing nodes as network of workstations (NOW) or network of massive NOW modules (Grid). The achieved results of the developed analytical models we have compared with the results of tested computing nodes with other alternative evaluation method based on suitable benchmarks to verify developed analytical models. The developed analytical models could be used under various ranges of input analytical parameters, which influence the architecture of analyzed computing nodes which are interested for the praxis.
The paper describes analytical modeling for single computing nodes of parallel computers. At first the paper describes very shortly the developing steps of parallel computer architectures and then he summarized the basic concepts for performance evaluation. To illustrate theoretical evaluation concepts the paper considers in its experimental part the achieved results on concrete analyzed examples and their comparison. The suggested analytical models consider for single computing node based on processor or core and SMP modeling of own computer node´s activities and node´s communication channels of performed data communications within computing node queuing theory systems M/D/m or M/D/. In case of using SMP parallel system as node computer the suggested models consider for own node’s activities M/M/m or M/D/m queuing theory systems. Although we are able to use other more complicated queuing theory systems we prefer modeling with mentioned models because achieved results for these models we can use in decomposed modeling of coupled computing nodes as network of workstations (NOW) or network of massive NOW modules (Grid). The achieved results of the developed analytical models we have compared with the results of tested computing nodes with other alternative evaluation method based on suitable benchmarks to verify developed analytical models. The developed analytical models could be used under various ranges of input analytical parameters, which influence the architecture of analyzed computing nodes which are interested for the praxis.
Modeling of Single Computing Nodes of Parallel Computers
doi:10.11648/j.ajnc.s.2014030501.15
American Journal of Networks and Communications
2014-07-31
© Science Publishing Group
Peter Hanuliak
Michal Hanuliak
Modeling of Single Computing Nodes of Parallel Computers
3
5
69
69
2014-07-31
2014-07-31
10.11648/j.ajnc.s.2014030501.15
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.15
© Science Publishing Group
Modeling of Parallel Computers Based on Network of Computing
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.14
The optimal resource allocation to satisfy such demands and the proper settlement of contention when demands exceed the capacity of the resources, constitute the problem of being able to understand and to predict system behavior. To this analysis we can use both analytical and simulation methods. Modeling and simulation are methods, which are commonly used by performance analysts to represent constraints and to optimize performance. Principally analytical methods represented first of all by queuing theory belongs to the preferred method in comparison to the simulation method, because of their potential ability of general analysis and also of their ability to potentially analyze also massive parallel computers. But these arguments supposed to develop and to verify suggested analytical models. This article goes further in applying the achieved analytical results in queuing theory for complex performance evaluation in parallel computing [9, 14]. The extensions are mainly in extending derived analytical models to whole range of parallel computers including massive parallel computers (Grid, meta computer). The article therefore describes standard analytical model based on M/M/m, M/D/m and M/M/1, M/D/1 queuing theory systems. Then the paper describes derivation of the correction factor for standard analytical model, based on M/M/m and M/M/1 queuing systems, to study more precise their basic performance parameters (overhead latencies, throughput etc.). All the derived analytical models were compared with performed simulation results in order to estimate the magnitude of improvement. Likewise they were tested under various ranges of parameters, which influence the architecture of the parallel computers and its communication networks too. These results are very important in practical use.
The optimal resource allocation to satisfy such demands and the proper settlement of contention when demands exceed the capacity of the resources, constitute the problem of being able to understand and to predict system behavior. To this analysis we can use both analytical and simulation methods. Modeling and simulation are methods, which are commonly used by performance analysts to represent constraints and to optimize performance. Principally analytical methods represented first of all by queuing theory belongs to the preferred method in comparison to the simulation method, because of their potential ability of general analysis and also of their ability to potentially analyze also massive parallel computers. But these arguments supposed to develop and to verify suggested analytical models. This article goes further in applying the achieved analytical results in queuing theory for complex performance evaluation in parallel computing [9, 14]. The extensions are mainly in extending derived analytical models to whole range of parallel computers including massive parallel computers (Grid, meta computer). The article therefore describes standard analytical model based on M/M/m, M/D/m and M/M/1, M/D/1 queuing theory systems. Then the paper describes derivation of the correction factor for standard analytical model, based on M/M/m and M/M/1 queuing systems, to study more precise their basic performance parameters (overhead latencies, throughput etc.). All the derived analytical models were compared with performed simulation results in order to estimate the magnitude of improvement. Likewise they were tested under various ranges of parameters, which influence the architecture of the parallel computers and its communication networks too. These results are very important in practical use.
Modeling of Parallel Computers Based on Network of Computing
doi:10.11648/j.ajnc.s.2014030501.14
American Journal of Networks and Communications
2014-07-31
© Science Publishing Group
Michal Hanuliak
Modeling of Parallel Computers Based on Network of Computing
3
5
56
56
2014-07-31
2014-07-31
10.11648/j.ajnc.s.2014030501.14
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.14
© Science Publishing Group
Modeling of Communication Complexity in Parallel Computing
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.13
Parallel principles are the most effective way how to increase parallel computer performance and parallel algorithms (PA) too. Parallel using of more computing nodes (processors, cores), which have to cooperate each other in solving complex problems in a parallel way, opened imperative problem of modeling communication complexity so in symmetrical multiprocessors (SMP) based on motherboard as in other asynchronous parallel computers (computer networks, cluster etc.). In actually dominant parallel computers based on NOW and Grid (network of NOW networks) [31] there is necessary to model communication latency because it could be dominant at using massive (number of processors more than 100) parallel computers [17]. In this sense the paper is devoted to modeling of communication complexity in parallel computing (parallel computers and algorithms). At first the paper describes very shortly various used communication topologies and networks and then it summarized basic concepts for modeling of communication complexity and latency too. To illustrate the analyzed modeling concepts the paper considers in its experimental part the results for real analyzed examples of abstract square matrix and its possible decomposition models. These illustration examples we have chosen first due to wide matrix application in scientific and engineering fields and second from its typical exemplary representation for any other PA.
Parallel principles are the most effective way how to increase parallel computer performance and parallel algorithms (PA) too. Parallel using of more computing nodes (processors, cores), which have to cooperate each other in solving complex problems in a parallel way, opened imperative problem of modeling communication complexity so in symmetrical multiprocessors (SMP) based on motherboard as in other asynchronous parallel computers (computer networks, cluster etc.). In actually dominant parallel computers based on NOW and Grid (network of NOW networks) [31] there is necessary to model communication latency because it could be dominant at using massive (number of processors more than 100) parallel computers [17]. In this sense the paper is devoted to modeling of communication complexity in parallel computing (parallel computers and algorithms). At first the paper describes very shortly various used communication topologies and networks and then it summarized basic concepts for modeling of communication complexity and latency too. To illustrate the analyzed modeling concepts the paper considers in its experimental part the results for real analyzed examples of abstract square matrix and its possible decomposition models. These illustration examples we have chosen first due to wide matrix application in scientific and engineering fields and second from its typical exemplary representation for any other PA.
Modeling of Communication Complexity in Parallel Computing
doi:10.11648/j.ajnc.s.2014030501.13
American Journal of Networks and Communications
2014-07-31
© Science Publishing Group
Juraj Hanuliak
Modeling of Communication Complexity in Parallel Computing
3
5
42
42
2014-07-31
2014-07-31
10.11648/j.ajnc.s.2014030501.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2014030501.13
© Science Publishing Group
Route Research for Ad Hoc Network
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140306.11
Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node’s routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information, which reduces the header length of intranet packets. By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly. We finally present a routing algorithm to select a most economical path among potential routing paths.
Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node’s routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information, which reduces the header length of intranet packets. By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly. We finally present a routing algorithm to select a most economical path among potential routing paths.
Route Research for Ad Hoc Network
doi:10.11648/j.ajnc.20140306.11
American Journal of Networks and Communications
2014-12-19
© Science Publishing Group
Zhengxi Wei
Route Research for Ad Hoc Network
3
6
76
76
2014-12-19
2014-12-19
10.11648/j.ajnc.20140306.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140306.11
© Science Publishing Group
A Review on Vandalism Detection in OpenStreetMap Data and Emerging Trends
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140306.12
More than the last few period technological enlargements incorporate the increase of online mapping. Next to that, OpenStreetMap project, a standard basis of generously data composed via different cases, have experience a reliable raise in status in modern time. Solitary, key requirement to facilitate is directly connected to this status is raise in dissimilar kind of defacement. Appropriateness and Consistency of peer-production in accumulation to the accomplishment of universe are the victims of vandalism. The query still is: By what means OSM project shelter its dignity in opposition to statistics vandalism? The resolution of this query is analyzed in this paper using diverse instances and identification of vandalism enhancing by tools.
More than the last few period technological enlargements incorporate the increase of online mapping. Next to that, OpenStreetMap project, a standard basis of generously data composed via different cases, have experience a reliable raise in status in modern time. Solitary, key requirement to facilitate is directly connected to this status is raise in dissimilar kind of defacement. Appropriateness and Consistency of peer-production in accumulation to the accomplishment of universe are the victims of vandalism. The query still is: By what means OSM project shelter its dignity in opposition to statistics vandalism? The resolution of this query is analyzed in this paper using diverse instances and identification of vandalism enhancing by tools.
A Review on Vandalism Detection in OpenStreetMap Data and Emerging Trends
doi:10.11648/j.ajnc.20140306.12
American Journal of Networks and Communications
2014-12-26
© Science Publishing Group
Nitasha Singla
Sukhjit Singh Sehra
Jaiteg Singh
A Review on Vandalism Detection in OpenStreetMap Data and Emerging Trends
3
6
83
83
2014-12-26
2014-12-26
10.11648/j.ajnc.20140306.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20140306.12
© Science Publishing Group
About Software Implementation of Network Steganography Retransmission Based Algorithm
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150401.11
Hybrid network steganography method RSTEG was implemented for Windows TCP/IP stack. The implementation description is provided, including further development prospects.
Hybrid network steganography method RSTEG was implemented for Windows TCP/IP stack. The implementation description is provided, including further development prospects.
About Software Implementation of Network Steganography Retransmission Based Algorithm
doi:10.11648/j.ajnc.20150401.11
American Journal of Networks and Communications
2015-01-23
© Science Publishing Group
D. Pavlin
A. Makosiy
About Software Implementation of Network Steganography Retransmission Based Algorithm
4
1
4
4
2015-01-23
2015-01-23
10.11648/j.ajnc.20150401.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150401.11
© Science Publishing Group
Driver Assistance System Based on Video Image Processing for Emergency Case in Tunnel
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150401.12
This paper proposes architecture for detecting accidents system based on image processing techniques for emergency case in tunnel, as well as the technical challenges that had to be overcome to ensure that technology successfully operated under all conditions. The advantages of this method include such benefits as Non-use of sensors, low cost and easy setup and relatively good accuracy and speed. Because this method has been implemented using image processing and MATLAB software, production costs are low while achieving high speed and accuracy. Method presented in this research is simple and there is no need to use sensors that have been commonly used to detect traffic in the past. This research can be enhanced by helping out the driver assistance system, this is accomplished by informing the public traffic about accidents in specific areas so that they can avoid those routes.
This paper proposes architecture for detecting accidents system based on image processing techniques for emergency case in tunnel, as well as the technical challenges that had to be overcome to ensure that technology successfully operated under all conditions. The advantages of this method include such benefits as Non-use of sensors, low cost and easy setup and relatively good accuracy and speed. Because this method has been implemented using image processing and MATLAB software, production costs are low while achieving high speed and accuracy. Method presented in this research is simple and there is no need to use sensors that have been commonly used to detect traffic in the past. This research can be enhanced by helping out the driver assistance system, this is accomplished by informing the public traffic about accidents in specific areas so that they can avoid those routes.
Driver Assistance System Based on Video Image Processing for Emergency Case in Tunnel
doi:10.11648/j.ajnc.20150401.12
American Journal of Networks and Communications
2015-03-13
© Science Publishing Group
Huthaifa Ahmad Al_Issa
Driver Assistance System Based on Video Image Processing for Emergency Case in Tunnel
4
1
9
9
2015-03-13
2015-03-13
10.11648/j.ajnc.20150401.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150401.12
© Science Publishing Group
Enhancement LTE System Based on DWT and Four STBC Transmit Antennas in Multichannel Models
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150402.11
In this paper Enhancement detail for the two main applications of Long Term Evolution (LTE) these are fixed and Mobile LTE. Fixed LTE will send the data from a single point-to-multipoint like user's houses and companies. While full mobility achieved by Mobile LTE to cellular networks. This done at very high broadband data rate comparted with other broadband networks like WiMax and Wi-Fi. The two types of LTE above are used in planning of a proper network which offers better throughput wireless broadband connectivity with lower cost. This work present a new proposed structures for LTE based on Space Time Block Coding (STBC-LTE) and Discrete Wavelets Transform (DWT) as multicarrier. The purpose of these new proposed structures is to improve the performance of bit error rate (BER) compared with the conventional STBC-LTE that use fast Fourier transform (FFT) as multicarrier. In addition, the new proposed structures with more than three transmits antennas and DWT was used in first time in LTE systems to enhance spectral efficiency and supports BER performance. The proposed STBC- LTE systems have been examined under different channel models like “AWGN, flat fading, and three types of multipath selective fading channel models (Extended Pedestrian, Extended Vehicular and Extended Typical Urban)”. The simulation results achieved in this work show that STBC- LTE based on DWT with four transmits antennas given best between other conventional STBC-LTE based on FFT systems. All these LTE systems models were built using MATLAB 2014a to permit various system parameters to be changed and tested like signal to noise ratio (SNR) and maximum Doppler shift and type of channel and channel parameters of the system.
In this paper Enhancement detail for the two main applications of Long Term Evolution (LTE) these are fixed and Mobile LTE. Fixed LTE will send the data from a single point-to-multipoint like user's houses and companies. While full mobility achieved by Mobile LTE to cellular networks. This done at very high broadband data rate comparted with other broadband networks like WiMax and Wi-Fi. The two types of LTE above are used in planning of a proper network which offers better throughput wireless broadband connectivity with lower cost. This work present a new proposed structures for LTE based on Space Time Block Coding (STBC-LTE) and Discrete Wavelets Transform (DWT) as multicarrier. The purpose of these new proposed structures is to improve the performance of bit error rate (BER) compared with the conventional STBC-LTE that use fast Fourier transform (FFT) as multicarrier. In addition, the new proposed structures with more than three transmits antennas and DWT was used in first time in LTE systems to enhance spectral efficiency and supports BER performance. The proposed STBC- LTE systems have been examined under different channel models like “AWGN, flat fading, and three types of multipath selective fading channel models (Extended Pedestrian, Extended Vehicular and Extended Typical Urban)”. The simulation results achieved in this work show that STBC- LTE based on DWT with four transmits antennas given best between other conventional STBC-LTE based on FFT systems. All these LTE systems models were built using MATLAB 2014a to permit various system parameters to be changed and tested like signal to noise ratio (SNR) and maximum Doppler shift and type of channel and channel parameters of the system.
Enhancement LTE System Based on DWT and Four STBC Transmit Antennas in Multichannel Models
doi:10.11648/j.ajnc.20150402.11
American Journal of Networks and Communications
2015-03-16
© Science Publishing Group
Laith Ali Abdul-Rahaim
Enhancement LTE System Based on DWT and Four STBC Transmit Antennas in Multichannel Models
4
2
20
20
2015-03-16
2015-03-16
10.11648/j.ajnc.20150402.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150402.11
© Science Publishing Group
Effective Energy Constraint Routing with On-Demand Routing Protocols in MANET
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150402.12
MANET is a dynamically reconfigurable wireless network with no fixed infrastructure. Each node acts as a router and host and it moves in an arbitrary manner in many ad hoc networks. It is significant that an energy conscious routing strategy should be adopted to minimize the energy required for communication. In such an environment, each host acts as a router and forwards packets to the next hop in order to reach, hop by hop, the final target. The major requirement in the MANET is which are usually characterized by mobile nodes with limited battery, is to limit the energy consumption.So, in this paper we are going to do the effective routing with the on demand protocols. The proposed method will try to prove that RAODV is better protocol than AODV and DSR using Network Simulator. To meet the new challenges, innovative protocols are needed to achieve energy efficiency, flexible scalability and adaptability and good network performance. This paper seeks to study and analyze the on demand routing protocols with identical loads and environment conditions and also evaluate their relative performance with respect to performance metrics.
MANET is a dynamically reconfigurable wireless network with no fixed infrastructure. Each node acts as a router and host and it moves in an arbitrary manner in many ad hoc networks. It is significant that an energy conscious routing strategy should be adopted to minimize the energy required for communication. In such an environment, each host acts as a router and forwards packets to the next hop in order to reach, hop by hop, the final target. The major requirement in the MANET is which are usually characterized by mobile nodes with limited battery, is to limit the energy consumption.So, in this paper we are going to do the effective routing with the on demand protocols. The proposed method will try to prove that RAODV is better protocol than AODV and DSR using Network Simulator. To meet the new challenges, innovative protocols are needed to achieve energy efficiency, flexible scalability and adaptability and good network performance. This paper seeks to study and analyze the on demand routing protocols with identical loads and environment conditions and also evaluate their relative performance with respect to performance metrics.
Effective Energy Constraint Routing with On-Demand Routing Protocols in MANET
doi:10.11648/j.ajnc.20150402.12
American Journal of Networks and Communications
2015-03-30
© Science Publishing Group
Kanwal Deep Kaur
Manish Bhardwaj
Effective Energy Constraint Routing with On-Demand Routing Protocols in MANET
4
2
24
24
2015-03-30
2015-03-30
10.11648/j.ajnc.20150402.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150402.12
© Science Publishing Group
Full Width at Half Maximum (FWHM) Analysis of Solitonic Pulse Applicable in Optical Network Communication
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040201.11
In this paper, we propose a system of microring resonator (MRR). This system uses a laser diode input which can be incorporated with an optical add/drop filter system. When light from the laser diode feedbacks to the fiber ring resonator, the pulses in the form of soliton can be generated by using appropriate fiber ring resonator parameters and also the input power. The filtering process occurs during the propagation of the pulse within the ring resonators. The full width at half maximum (FWHM) or bandwidth characterization of the pulse can be performed using the proposed system. Results obtained have established particular possibilities from the application such as optical network communication. The obtained results show the effects of coupling coefficients and ring radius on the bandwidth of the soliton pulse, where the graph of the FWHM versus the variable parameters such as the radius and coupling coefficient are presented.
In this paper, we propose a system of microring resonator (MRR). This system uses a laser diode input which can be incorporated with an optical add/drop filter system. When light from the laser diode feedbacks to the fiber ring resonator, the pulses in the form of soliton can be generated by using appropriate fiber ring resonator parameters and also the input power. The filtering process occurs during the propagation of the pulse within the ring resonators. The full width at half maximum (FWHM) or bandwidth characterization of the pulse can be performed using the proposed system. Results obtained have established particular possibilities from the application such as optical network communication. The obtained results show the effects of coupling coefficients and ring radius on the bandwidth of the soliton pulse, where the graph of the FWHM versus the variable parameters such as the radius and coupling coefficient are presented.
Full Width at Half Maximum (FWHM) Analysis of Solitonic Pulse Applicable in Optical Network Communication
doi:10.11648/j.ajnc.s.2015040201.11
American Journal of Networks and Communications
2014-11-22
© Science Publishing Group
IS Amiri
H. Ahmad
Hamza M. R. Al-Khafaji
Full Width at Half Maximum (FWHM) Analysis of Solitonic Pulse Applicable in Optical Network Communication
4
2
5
5
2014-11-22
2014-11-22
10.11648/j.ajnc.s.2015040201.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040201.11
© Science Publishing Group
A Review of Ultra-Short Soliton Pulse Generation Using InGaAsP/InP Microring Resonator (MRR) Systems
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040201.12
System of microring resonators (MRRs) incorporating with an add/drop MRR system are presented to generate single and multi-temporal and spatial ultra-short soliton pulses applicable in optical soliton communications. The chaotic signals caused by the nonlinear condition could be generated and propagated within the system. The Kerr effect in the MRR system induces the nonlinearity condition. The proposed MRR systems are used to generate ultra-short soliton pulse within the system. Using the appropriate MRR parameters, ultra-short spatial and temporal signals are generated spreading over the spectrum. In this work, narrow soliton pulses could be localized within the proposed systems. Here soliton pulses of 0.7 ps, 0.83 fs and 19 pm are generated using series of MRRs connected to an add/drop MRR system. The nonlinear refractive index is n2=2.2 x 10-17 m2/W. Using the panda ring resonator system, the ultra-short soliton pulses with full width at half maximum (FWHM) and free spectral range (FSR) of 5 MHz and 2 GHz, were generated at the throughput port. The output signals pulses with FWHM of 10 MHz and FSR of 2 GHz could be obtained at the drop port of the system. As second results using this system, multi-carrier soliton pulses with FWHM=20 MHz are localized within this system with respect to 20,000 roundtrips of the input pulse. Localized optical tweezers could be generated using the half-Panda MRR system, where the peaks have FWHM and FSR of 8.9 nm and 50 nm respectively. The nonlinear refractive index was selected to n2=2.5×10-17 m2/W.
System of microring resonators (MRRs) incorporating with an add/drop MRR system are presented to generate single and multi-temporal and spatial ultra-short soliton pulses applicable in optical soliton communications. The chaotic signals caused by the nonlinear condition could be generated and propagated within the system. The Kerr effect in the MRR system induces the nonlinearity condition. The proposed MRR systems are used to generate ultra-short soliton pulse within the system. Using the appropriate MRR parameters, ultra-short spatial and temporal signals are generated spreading over the spectrum. In this work, narrow soliton pulses could be localized within the proposed systems. Here soliton pulses of 0.7 ps, 0.83 fs and 19 pm are generated using series of MRRs connected to an add/drop MRR system. The nonlinear refractive index is n2=2.2 x 10-17 m2/W. Using the panda ring resonator system, the ultra-short soliton pulses with full width at half maximum (FWHM) and free spectral range (FSR) of 5 MHz and 2 GHz, were generated at the throughput port. The output signals pulses with FWHM of 10 MHz and FSR of 2 GHz could be obtained at the drop port of the system. As second results using this system, multi-carrier soliton pulses with FWHM=20 MHz are localized within this system with respect to 20,000 roundtrips of the input pulse. Localized optical tweezers could be generated using the half-Panda MRR system, where the peaks have FWHM and FSR of 8.9 nm and 50 nm respectively. The nonlinear refractive index was selected to n2=2.5×10-17 m2/W.
A Review of Ultra-Short Soliton Pulse Generation Using InGaAsP/InP Microring Resonator (MRR) Systems
doi:10.11648/j.ajnc.s.2015040201.12
American Journal of Networks and Communications
2014-12-27
© Science Publishing Group
I. S. Amiri
H. Ahmad
Hamza M. R. Al-Khafaji
A Review of Ultra-Short Soliton Pulse Generation Using InGaAsP/InP Microring Resonator (MRR) Systems
4
2
17
17
2014-12-27
2014-12-27
10.11648/j.ajnc.s.2015040201.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040201.12
© Science Publishing Group
IP Routing by Phase Induced Intensity Noise Suppression in Optical CDMA Network
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040201.13
In this paper, we explore avenues to efficiently use spectral amplitude coding optical code-division multiple-access (SAC-OCDMA) technique as a solution to the Internet protocol (IP) routing bottleneck in the global internet access. This work reveals for the first time the authors proposed a novel class of codes called the flexible cross correlation (FCC) code to enhance the network capacity and achieve the highest performance possible through phase induced intensity noise (PIIN) evasion and eliminating multiple access interference (MAI). The results indicated good performance, where the FCC code can accommodate 150 simultaneous users and has an optimum receive power Psr = -25 dBm at the receiving plant. It is truly proved that, from the theoretical results, the SAC-OCDMA technique can be an excellent candidate for the future IP backbone.
In this paper, we explore avenues to efficiently use spectral amplitude coding optical code-division multiple-access (SAC-OCDMA) technique as a solution to the Internet protocol (IP) routing bottleneck in the global internet access. This work reveals for the first time the authors proposed a novel class of codes called the flexible cross correlation (FCC) code to enhance the network capacity and achieve the highest performance possible through phase induced intensity noise (PIIN) evasion and eliminating multiple access interference (MAI). The results indicated good performance, where the FCC code can accommodate 150 simultaneous users and has an optimum receive power Psr = -25 dBm at the receiving plant. It is truly proved that, from the theoretical results, the SAC-OCDMA technique can be an excellent candidate for the future IP backbone.
IP Routing by Phase Induced Intensity Noise Suppression in Optical CDMA Network
doi:10.11648/j.ajnc.s.2015040201.13
American Journal of Networks and Communications
2015-02-11
© Science Publishing Group
C. B. M. Rashidi
S. A. Aljunid
M. S. Anuar
Hassan Yousif Ahmed
IP Routing by Phase Induced Intensity Noise Suppression in Optical CDMA Network
4
2
21
21
2015-02-11
2015-02-11
10.11648/j.ajnc.s.2015040201.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040201.13
© Science Publishing Group
Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.11
To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.
To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.
Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
doi:10.11648/j.ajnc.20150403.11
American Journal of Networks and Communications
2015-04-15
© Science Publishing Group
Pourush
Naresh Sharma
Manish Bhardwaj
Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
4
3
31
31
2015-04-15
2015-04-15
10.11648/j.ajnc.20150403.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.11
© Science Publishing Group
Cryptanalysis of Simplified Data Encryption Standard Using Genetic Algorithm
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.12
Cryptanalysis of cipher text using evolutionary algorithm has gained much interest in the last decade. In this paper, cryptanalysis of SDES has been performed using Genetic Algorithm with Ring Crossover operator. Cryptography has been prone to many attacks but the scope of this paper is limited only to the cipher text attack. Different combinations of keys are generated using the Genetic Algorithm and hence it is concluded that Genetic Algorithm is a better approach than the Brute Force for analyzing SDES.
Cryptanalysis of cipher text using evolutionary algorithm has gained much interest in the last decade. In this paper, cryptanalysis of SDES has been performed using Genetic Algorithm with Ring Crossover operator. Cryptography has been prone to many attacks but the scope of this paper is limited only to the cipher text attack. Different combinations of keys are generated using the Genetic Algorithm and hence it is concluded that Genetic Algorithm is a better approach than the Brute Force for analyzing SDES.
Cryptanalysis of Simplified Data Encryption Standard Using Genetic Algorithm
doi:10.11648/j.ajnc.20150403.12
American Journal of Networks and Communications
2015-04-28
© Science Publishing Group
Purvi Garg
Shivangi Varshney
Manish Bhardwaj
Cryptanalysis of Simplified Data Encryption Standard Using Genetic Algorithm
4
3
36
36
2015-04-28
2015-04-28
10.11648/j.ajnc.20150403.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.12
© Science Publishing Group
Performance Analysis of Hybrid Web Caching Architecture
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.13
The development of next-generation wireless networks combine with the radio network techniques which use technology such as GSM, GPRS, 3G (UMTS, CDMA2000), LTE, WLAN, and WiMAX. It requires the construction and expansion in time of high-speed telecommunication channels for the level of the internet service provider (ISP). In fact, in many developing countries and in Vietnam, the investment rate increased bandwidth capacity can not enough for the demand use the Internet as economic issues, investment procedures. Web caching architecture is one of the effective solutions to save bandwidth while ensuring to satisfy strong demand for internet access. Hybrid web caching architecture (hybrid web caching architecture) is a solution that is used by networks because it takes advantage of the strengths of the web caching architecture stratification and dispersion, reducing connection time and transmission time, helping internet service providers to plan and save network resources at each level in an optimal way. This paper propose a novel produce to hybrid web caching architecture based on the determined time at each level of web-winning network and web time overall winner of the ISP network with n-level network.
The development of next-generation wireless networks combine with the radio network techniques which use technology such as GSM, GPRS, 3G (UMTS, CDMA2000), LTE, WLAN, and WiMAX. It requires the construction and expansion in time of high-speed telecommunication channels for the level of the internet service provider (ISP). In fact, in many developing countries and in Vietnam, the investment rate increased bandwidth capacity can not enough for the demand use the Internet as economic issues, investment procedures. Web caching architecture is one of the effective solutions to save bandwidth while ensuring to satisfy strong demand for internet access. Hybrid web caching architecture (hybrid web caching architecture) is a solution that is used by networks because it takes advantage of the strengths of the web caching architecture stratification and dispersion, reducing connection time and transmission time, helping internet service providers to plan and save network resources at each level in an optimal way. This paper propose a novel produce to hybrid web caching architecture based on the determined time at each level of web-winning network and web time overall winner of the ISP network with n-level network.
Performance Analysis of Hybrid Web Caching Architecture
doi:10.11648/j.ajnc.20150403.13
American Journal of Networks and Communications
2015-04-28
© Science Publishing Group
Ho Khanh Lam
Nguyen Xuan Truong
Performance Analysis of Hybrid Web Caching Architecture
4
3
43
43
2015-04-28
2015-04-28
10.11648/j.ajnc.20150403.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.13
© Science Publishing Group
Static Heuristics Classifiers as Pre-Filter for Malware Target Recognition (MATR)
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.14
Now a day’s malware are one of the major threats to computer information system. The current malware detection technologies have certain significant limitations on their part. Different organizations which deal with the protection of sensitive information may face the problem in identifying recent malware threats among millions and billions of benign executables using just signature-based antivirus systems. Currently for frontline defense against malware, signature-based antivirus products are used by organization.In the undergoing project, we proposed a detection approach by using static heuristics in MATR for malware in PE (portable executable) files. The project suggestslarger performance-based malware target recognition architecture that at present use only static heuristic features.Results of the experiments show that this architecture achieves an overall test accuracy of greater than 98% againstmalware set collected from various operational environments, while most antivirus provide detection accuracy of only 60% at their most sensitive configuration [1]. Implementations of this architecture enables benign executables to be classified successfully to some extent providing enhanced awareness of operators in hostile environments it also enable detection of unknown malware. We are to show the performance of Bagging and AdaBoostensemble.
Now a day’s malware are one of the major threats to computer information system. The current malware detection technologies have certain significant limitations on their part. Different organizations which deal with the protection of sensitive information may face the problem in identifying recent malware threats among millions and billions of benign executables using just signature-based antivirus systems. Currently for frontline defense against malware, signature-based antivirus products are used by organization.In the undergoing project, we proposed a detection approach by using static heuristics in MATR for malware in PE (portable executable) files. The project suggestslarger performance-based malware target recognition architecture that at present use only static heuristic features.Results of the experiments show that this architecture achieves an overall test accuracy of greater than 98% againstmalware set collected from various operational environments, while most antivirus provide detection accuracy of only 60% at their most sensitive configuration [1]. Implementations of this architecture enables benign executables to be classified successfully to some extent providing enhanced awareness of operators in hostile environments it also enable detection of unknown malware. We are to show the performance of Bagging and AdaBoostensemble.
Static Heuristics Classifiers as Pre-Filter for Malware Target Recognition (MATR)
doi:10.11648/j.ajnc.20150403.14
American Journal of Networks and Communications
2015-05-12
© Science Publishing Group
Anuj Lohani
Aditi Lohani
Jitendra Singh
Manish Bhardwaj
Static Heuristics Classifiers as Pre-Filter for Malware Target Recognition (MATR)
4
3
48
48
2015-05-12
2015-05-12
10.11648/j.ajnc.20150403.14
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.14
© Science Publishing Group
Portable Weather System for Measure and Monitoring Temperature, Relative Humidity, and Pressure, Based on Bluetooth Communication
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.15
The system also proposes a wireless connectivity by using the Bluetooth communication standard providing of a reliable, portable and a low-cost tool for industry where it is necessary to have an environmental control to carry out critical processes. The weather system consist of an embedded system to the development of multimedia applications based on the PIC32 microcontroller, and development is performed using the SPIES methodology for the construct embedded systems. In this paper the design of a portable system that allows monitoring of four climatic variables (temperature, relative humidity, pressure and altitude). The purpose of the system is to serve as an auxiliary tool to make decisions subsystems for environmental control in different areas.
The system also proposes a wireless connectivity by using the Bluetooth communication standard providing of a reliable, portable and a low-cost tool for industry where it is necessary to have an environmental control to carry out critical processes. The weather system consist of an embedded system to the development of multimedia applications based on the PIC32 microcontroller, and development is performed using the SPIES methodology for the construct embedded systems. In this paper the design of a portable system that allows monitoring of four climatic variables (temperature, relative humidity, pressure and altitude). The purpose of the system is to serve as an auxiliary tool to make decisions subsystems for environmental control in different areas.
Portable Weather System for Measure and Monitoring Temperature, Relative Humidity, and Pressure, Based on Bluetooth Communication
doi:10.11648/j.ajnc.20150403.15
American Journal of Networks and Communications
2015-05-13
© Science Publishing Group
Edgar Manuel Cano Cruz
Juan Gabriel Ruiz Ruiz
Portable Weather System for Measure and Monitoring Temperature, Relative Humidity, and Pressure, Based on Bluetooth Communication
4
3
53
53
2015-05-13
2015-05-13
10.11648/j.ajnc.20150403.15
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.15
© Science Publishing Group
Audio Codecs Impact on Quality of VoIP Based on IEEE802.16e Considering Mobile IP Handover
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.17
A simulation model using OPNET tool is introduced for testing audio codecs impact on quality of VoIP based on IEEE802.16e with taking into account handover performance. Different parameters that indicate the quality of VoIP such as Throughput, MOS, End to End delay and traffic send and received. According to our simulation the acceptable MOS value is recorded for codecs G.711 and GSM-FR.
A simulation model using OPNET tool is introduced for testing audio codecs impact on quality of VoIP based on IEEE802.16e with taking into account handover performance. Different parameters that indicate the quality of VoIP such as Throughput, MOS, End to End delay and traffic send and received. According to our simulation the acceptable MOS value is recorded for codecs G.711 and GSM-FR.
Audio Codecs Impact on Quality of VoIP Based on IEEE802.16e Considering Mobile IP Handover
doi:10.11648/j.ajnc.20150403.17
American Journal of Networks and Communications
2015-06-06
© Science Publishing Group
Ali M. Alsahlany
Hayder S. Rashid
Audio Codecs Impact on Quality of VoIP Based on IEEE802.16e Considering Mobile IP Handover
4
3
66
66
2015-06-06
2015-06-06
10.11648/j.ajnc.20150403.17
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.17
© Science Publishing Group
Performance Analysis of CPU-GPU Cluster Architectures
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.18
High performance computing (HPC) encompasses advanced computation over parallel processing, enabling faster execution of highly compute intensive tasks such as climate research, molecular modeling, physical simulations, cryptanalysis, geophysical modeling, automotive and aerospace design, financial modeling, data mining and more. High performance simulations require the most efficient compute platforms. The execution time of a given simulation depends upon many factors, such as the number of CPU/GPU cores and their utilization factor and the interconnect performance, efficiency, and scalability. CPU and GPU clusters are one of the most progressive branches in a field of parallel computing and data processing nowadays. GPUs have become increasingly common in supercomputing, serving as accelerators or "co-processors" in every node CPU-GPU to help CPUs get work done faster. In this paper I use the Multiclass Closed Product-Form Queueing Network (MCPFQN) and Mean Value Analysis (MVA) to analyze effects of the CPU-GPU cluster interconnect on the performance of computer systems.
High performance computing (HPC) encompasses advanced computation over parallel processing, enabling faster execution of highly compute intensive tasks such as climate research, molecular modeling, physical simulations, cryptanalysis, geophysical modeling, automotive and aerospace design, financial modeling, data mining and more. High performance simulations require the most efficient compute platforms. The execution time of a given simulation depends upon many factors, such as the number of CPU/GPU cores and their utilization factor and the interconnect performance, efficiency, and scalability. CPU and GPU clusters are one of the most progressive branches in a field of parallel computing and data processing nowadays. GPUs have become increasingly common in supercomputing, serving as accelerators or "co-processors" in every node CPU-GPU to help CPUs get work done faster. In this paper I use the Multiclass Closed Product-Form Queueing Network (MCPFQN) and Mean Value Analysis (MVA) to analyze effects of the CPU-GPU cluster interconnect on the performance of computer systems.
Performance Analysis of CPU-GPU Cluster Architectures
doi:10.11648/j.ajnc.20150403.18
American Journal of Networks and Communications
2015-06-12
© Science Publishing Group
Ho Khanh Lam
Performance Analysis of CPU-GPU Cluster Architectures
4
3
74
74
2015-06-12
2015-06-12
10.11648/j.ajnc.20150403.18
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.18
© Science Publishing Group
The Effect of Changing Substrate Material and Thickness on the Performance of Inset Feed Microstrip Patch Antenna
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.16
In order to design a microstrip patch antenna at first the designer is to select the substrate material and it’s thickness. So, if the designer has a clear conception about the effect of changing substrate material and it’s thickness on the performance of the antenna, it will be easier to design an antenna. Appropriate selection of dielectric material and it’s thickness is an important task for designing a microstrip patch antenna. This paper represents that how antenna performance changes when we vary substrate material and it’s thickness. The designed inset feed rectangular microstrip patch antenna operates at 2.4GHz (ISM band).
In order to design a microstrip patch antenna at first the designer is to select the substrate material and it’s thickness. So, if the designer has a clear conception about the effect of changing substrate material and it’s thickness on the performance of the antenna, it will be easier to design an antenna. Appropriate selection of dielectric material and it’s thickness is an important task for designing a microstrip patch antenna. This paper represents that how antenna performance changes when we vary substrate material and it’s thickness. The designed inset feed rectangular microstrip patch antenna operates at 2.4GHz (ISM band).
The Effect of Changing Substrate Material and Thickness on the Performance of Inset Feed Microstrip Patch Antenna
doi:10.11648/j.ajnc.20150403.16
American Journal of Networks and Communications
2015-05-15
© Science Publishing Group
Liton Chandra Paul
Md. Sarwar Hosain
Sohag Sarker
Makhluk Hossain Prio
Monir Morshed
Ajay Krishno Sarkar
The Effect of Changing Substrate Material and Thickness on the Performance of Inset Feed Microstrip Patch Antenna
4
3
58
58
2015-05-15
2015-05-15
10.11648/j.ajnc.20150403.16
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.16
© Science Publishing Group
Efficient Sideband Noise Cancellation for Co-located Networks Using ANCT
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.19
An efficient noise cancellation technique for a co-located network was realized using Adaptive Noise Cancellation Technique (ANCT). The technique was developed as improved feature to the classical application of passive filters. The paper focused on achieving a theoretical perfect cancellation considering three essential parameters: the amplitude, phase and delay characteristics of the signal and noise at both the primary path and the reference path of the co-located system. An experimental test-bed of the ANC Architecture was developed using Matlab-Simulink block design which demonstrated the error signals before and after cancellation.
An efficient noise cancellation technique for a co-located network was realized using Adaptive Noise Cancellation Technique (ANCT). The technique was developed as improved feature to the classical application of passive filters. The paper focused on achieving a theoretical perfect cancellation considering three essential parameters: the amplitude, phase and delay characteristics of the signal and noise at both the primary path and the reference path of the co-located system. An experimental test-bed of the ANC Architecture was developed using Matlab-Simulink block design which demonstrated the error signals before and after cancellation.
Efficient Sideband Noise Cancellation for Co-located Networks Using ANCT
doi:10.11648/j.ajnc.20150403.19
American Journal of Networks and Communications
2015-06-10
© Science Publishing Group
Nosiri Onyebuchi Chikezie
Ezeh Gloria Nwabugo
Agubor Cosmos Kemdirim
Nkwachukwu Chukwuchekwa
Efficient Sideband Noise Cancellation for Co-located Networks Using ANCT
4
3
84
84
2015-06-10
2015-06-10
10.11648/j.ajnc.20150403.19
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150403.19
© Science Publishing Group
Selection of Efficient Relay for Energy-Efficient Cooperative Ad Hoc Networks
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.12
The Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. This paper identify the challenges in the development of a centralized topology control scheme, named Cooperative Bridges, which reduces transmission power of nodes as well as increases network connectivity. Previous research on topology control with CC only focuses on maintaining the network connectivity, minimizing the transmission power of each node, whereas ignores the energy efficiency of paths in constructed topologies. This may cause inefficient routes and hurt the overall network performance in cooperative ad hoc networks. With the help of studied topology control problem for energy-efficient topology with cooperative communication. This paper proposed optimum relay nodes selection for CC network to reduce overall power consumption of network.
The Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. This paper identify the challenges in the development of a centralized topology control scheme, named Cooperative Bridges, which reduces transmission power of nodes as well as increases network connectivity. Previous research on topology control with CC only focuses on maintaining the network connectivity, minimizing the transmission power of each node, whereas ignores the energy efficiency of paths in constructed topologies. This may cause inefficient routes and hurt the overall network performance in cooperative ad hoc networks. With the help of studied topology control problem for energy-efficient topology with cooperative communication. This paper proposed optimum relay nodes selection for CC network to reduce overall power consumption of network.
Selection of Efficient Relay for Energy-Efficient Cooperative Ad Hoc Networks
doi:10.11648/j.ajnc.s.2015040301.12
American Journal of Networks and Communications
2015-01-18
© Science Publishing Group
Manish Bhardwaj
Selection of Efficient Relay for Energy-Efficient Cooperative Ad Hoc Networks
4
3
11
11
2015-01-18
2015-01-18
10.11648/j.ajnc.s.2015040301.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.12
© Science Publishing Group
Design of Secure Ad Hoc Network Using Three Dimensional Discrete Wavelet Transformation Based on Performance Enhancement
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.17
This work shows new and efficient algorithm of cryptographic purpose based symmetric and conventional techniques that considers the representation of the cipher text by using the three dimensional Discrete Wavelet Transform to find the wavelet decomposition vector containing the approximation and the detail coefficients then build the three dimensional data structure approach. The decryption is done by extracting the encrypted data from the wavelet decomposition vector using the algorithm of inverse Discrete Wavelet Transformation. The encrypted message consists the wavelet decomposition vector. The key is used for authorization purpose to access the network. Results shows great data security and BER over wireless channels based Ad Hoc network.
This work shows new and efficient algorithm of cryptographic purpose based symmetric and conventional techniques that considers the representation of the cipher text by using the three dimensional Discrete Wavelet Transform to find the wavelet decomposition vector containing the approximation and the detail coefficients then build the three dimensional data structure approach. The decryption is done by extracting the encrypted data from the wavelet decomposition vector using the algorithm of inverse Discrete Wavelet Transformation. The encrypted message consists the wavelet decomposition vector. The key is used for authorization purpose to access the network. Results shows great data security and BER over wireless channels based Ad Hoc network.
Design of Secure Ad Hoc Network Using Three Dimensional Discrete Wavelet Transformation Based on Performance Enhancement
doi:10.11648/j.ajnc.s.2015040301.17
American Journal of Networks and Communications
2015-01-22
© Science Publishing Group
Laith Ali Abdul-Rahaim
Ammar Abdulrasool Muneer
Design of Secure Ad Hoc Network Using Three Dimensional Discrete Wavelet Transformation Based on Performance Enhancement
4
3
44
44
2015-01-22
2015-01-22
10.11648/j.ajnc.s.2015040301.17
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.17
© Science Publishing Group
Security in Ad Hoc Networks
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.16
Ad hoc networks are a wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, these networks are self-configurable and autonomous systems which are able to support movability and organize themselves arbitrarily. These unique characteristics of ad hoc networks pose a number of challenges for the implementation of security infrastructure in the wireless network system design. In this paper, we study the ad-hoc architecture thus understanding the vulnerabilities and security goals. Further, we discuss the various security attacks and explore approaches to secure the communication.
Ad hoc networks are a wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, these networks are self-configurable and autonomous systems which are able to support movability and organize themselves arbitrarily. These unique characteristics of ad hoc networks pose a number of challenges for the implementation of security infrastructure in the wireless network system design. In this paper, we study the ad-hoc architecture thus understanding the vulnerabilities and security goals. Further, we discuss the various security attacks and explore approaches to secure the communication.
Security in Ad Hoc Networks
doi:10.11648/j.ajnc.s.2015040301.16
American Journal of Networks and Communications
2015-01-28
© Science Publishing Group
Sanjana Lakkadi
Amit Mishra
Manish Bhardwaj
Security in Ad Hoc Networks
4
3
34
34
2015-01-28
2015-01-28
10.11648/j.ajnc.s.2015040301.16
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.16
© Science Publishing Group
Efficient Routing with Reduced Routing Overhead and Retransmission of Manet
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.15
Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.
Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.
Efficient Routing with Reduced Routing Overhead and Retransmission of Manet
doi:10.11648/j.ajnc.s.2015040301.15
American Journal of Networks and Communications
2015-01-28
© Science Publishing Group
Megha Sharma
Shivani Rohilla
Manish Bhardwaj
Efficient Routing with Reduced Routing Overhead and Retransmission of Manet
4
3
26
26
2015-01-28
2015-01-28
10.11648/j.ajnc.s.2015040301.15
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.15
© Science Publishing Group
Ontology Based Fuzzy Query Execution
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.14
Database engineering has been progressed up to the Relational database stage. Fuzzy information administration in databases is a complex process in view of adaptable information nature and heterogeneous database frameworks. Relational Database Management System (RDBMS) can just handle fresh information but cannot handle precise data information. Structured Query Language (SQL) is a very powerful tool but can handle data which is crisp and precise in nature. It is not able to fulfill the requirements for information which is indeterminate, uncertain, inapplicable and imprecise and vague in nature. The goal of this work is to use Fuzzy technique in RDBMS. But, Fuzzy Relational Database Management System (FRDB) requires complex data structures, in most cases, are dependent on the platform in which they are implemented. A solution that involves representing an FRDB using an Ontology as an interface has been defined to overcome this problem. A new Fuzzy Query Ontology is proposed in this dissertation with implementation. The implementation layer, which is responsible for parsing and translating user requests into the corresponding DB implementations in transparent, is required to establish communication between the Ontology and the relational databases management system (RDBMS). This ontology defines a framework for storing fuzzy data by defining those using classes, slots, and instances. An Ontology is an explicit and formal specification of a conceptualization. Ontologies provides a shared understanding of a domain which allows interoperability between semantics.
Database engineering has been progressed up to the Relational database stage. Fuzzy information administration in databases is a complex process in view of adaptable information nature and heterogeneous database frameworks. Relational Database Management System (RDBMS) can just handle fresh information but cannot handle precise data information. Structured Query Language (SQL) is a very powerful tool but can handle data which is crisp and precise in nature. It is not able to fulfill the requirements for information which is indeterminate, uncertain, inapplicable and imprecise and vague in nature. The goal of this work is to use Fuzzy technique in RDBMS. But, Fuzzy Relational Database Management System (FRDB) requires complex data structures, in most cases, are dependent on the platform in which they are implemented. A solution that involves representing an FRDB using an Ontology as an interface has been defined to overcome this problem. A new Fuzzy Query Ontology is proposed in this dissertation with implementation. The implementation layer, which is responsible for parsing and translating user requests into the corresponding DB implementations in transparent, is required to establish communication between the Ontology and the relational databases management system (RDBMS). This ontology defines a framework for storing fuzzy data by defining those using classes, slots, and instances. An Ontology is an explicit and formal specification of a conceptualization. Ontologies provides a shared understanding of a domain which allows interoperability between semantics.
Ontology Based Fuzzy Query Execution
doi:10.11648/j.ajnc.s.2015040301.14
American Journal of Networks and Communications
2015-01-28
© Science Publishing Group
Geetanjali tyagi
kumar kaushik
Arnika Jain
Manish Bhardwaj
Ontology Based Fuzzy Query Execution
4
3
21
21
2015-01-28
2015-01-28
10.11648/j.ajnc.s.2015040301.14
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.14
© Science Publishing Group
An Adaptive Algorithm to Prevent SQL Injection
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.13
SQL Injection attacks are one of the top most threats for application written for the web. SQL Injection is a type of attack in which the attacker uses SQL commands to gain access or make changes to data. It allows attacker to obtain unauthorized access to the database to change the intended queries. In the web environment, end user privacy is one of the most controversial legal issues. Using SQL Injection, an attacker can leak confidential information such as credit card no. ATM Pin, User Credentials etc from the web applications or even corrupts the database. An unauthorized access to this much of confidential data by an attacker can threat to user confidentiality. In this paper, we had surveyed existing techniques against SQL Injection and analyzed their advantages and disadvantages and proposed a novel and effective solution to avoid attacks on login phase.
SQL Injection attacks are one of the top most threats for application written for the web. SQL Injection is a type of attack in which the attacker uses SQL commands to gain access or make changes to data. It allows attacker to obtain unauthorized access to the database to change the intended queries. In the web environment, end user privacy is one of the most controversial legal issues. Using SQL Injection, an attacker can leak confidential information such as credit card no. ATM Pin, User Credentials etc from the web applications or even corrupts the database. An unauthorized access to this much of confidential data by an attacker can threat to user confidentiality. In this paper, we had surveyed existing techniques against SQL Injection and analyzed their advantages and disadvantages and proposed a novel and effective solution to avoid attacks on login phase.
An Adaptive Algorithm to Prevent SQL Injection
doi:10.11648/j.ajnc.s.2015040301.13
American Journal of Networks and Communications
2015-01-28
© Science Publishing Group
Ashish John
Ajay Agarwal
Manish Bhardwaj
An Adaptive Algorithm to Prevent SQL Injection
4
3
15
15
2015-01-28
2015-01-28
10.11648/j.ajnc.s.2015040301.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.13
© Science Publishing Group
C2 Torus New Interconnection Network Topology Based on 2D Torus
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.11
Mesh and Torus are most popular interconnection topologies based on 2D-mesh. Comparison between Mesh and Torus will be considered and new interconnection topology will be proposed to provide better performance. The C2Mesh is an enhanced mesh interconnected network. This paper enhances the Performance of torus network based on the theme of C2Mesh. Topological Properties of new network will be analyzed and implemented by simulation. The new routing Algorithm will be designed for new proposed network (C2Torus).
Mesh and Torus are most popular interconnection topologies based on 2D-mesh. Comparison between Mesh and Torus will be considered and new interconnection topology will be proposed to provide better performance. The C2Mesh is an enhanced mesh interconnected network. This paper enhances the Performance of torus network based on the theme of C2Mesh. Topological Properties of new network will be analyzed and implemented by simulation. The new routing Algorithm will be designed for new proposed network (C2Torus).
C2 Torus New Interconnection Network Topology Based on 2D Torus
doi:10.11648/j.ajnc.s.2015040301.11
American Journal of Networks and Communications
2015-01-28
© Science Publishing Group
Manish Bhardwaj
C2 Torus New Interconnection Network Topology Based on 2D Torus
4
3
4
4
2015-01-28
2015-01-28
10.11648/j.ajnc.s.2015040301.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.11
© Science Publishing Group
Privacy Preserving Data Publishing through Slicing
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.18
Microdata publishing should be privacy preserved as it may contain some sensitive information about an individual. Various anonymization techniques, generalization and bucketization, have been designed for privacy preserving microdata publishing. Generalization does not work better for high dimensional data. Bucketization failed to prevent membership disclosure and does not show a clear separation between quasi-identifiers and sensitive attributes. There are number of attributes in each record which can be categorized as 1) Identifiers such as Name or Social Security Number are the attributes that can be uniquely identify the individuals. 2)Some attributes may be Sensitive Attributes(SAs) such as disease and salary and 3) Some may be Quasi Identifiers (QI) such as zipcode, age, and sex whose values, when taken together, can potentially identify an individual. Data anonymization enables the transfer of information across a boundary, such as between two departments within an agency or between two agencies, while reducing the risk of unintended disclosure, and in certain environments in a manner that enables evaluation and analytics post-anonymization. Here, we present a novel technique called slicing which partitions the data both horizontally and vertically. It preserves better data utility than generalization and is more effective than bucketization in terms of sensitive attribute.
Microdata publishing should be privacy preserved as it may contain some sensitive information about an individual. Various anonymization techniques, generalization and bucketization, have been designed for privacy preserving microdata publishing. Generalization does not work better for high dimensional data. Bucketization failed to prevent membership disclosure and does not show a clear separation between quasi-identifiers and sensitive attributes. There are number of attributes in each record which can be categorized as 1) Identifiers such as Name or Social Security Number are the attributes that can be uniquely identify the individuals. 2)Some attributes may be Sensitive Attributes(SAs) such as disease and salary and 3) Some may be Quasi Identifiers (QI) such as zipcode, age, and sex whose values, when taken together, can potentially identify an individual. Data anonymization enables the transfer of information across a boundary, such as between two departments within an agency or between two agencies, while reducing the risk of unintended disclosure, and in certain environments in a manner that enables evaluation and analytics post-anonymization. Here, we present a novel technique called slicing which partitions the data both horizontally and vertically. It preserves better data utility than generalization and is more effective than bucketization in terms of sensitive attribute.
Privacy Preserving Data Publishing through Slicing
doi:10.11648/j.ajnc.s.2015040301.18
American Journal of Networks and Communications
2015-02-12
© Science Publishing Group
Shivani Rohilla
Megha Sharma
A. Kulothungan
Manish Bhardwaj
Privacy Preserving Data Publishing through Slicing
4
3
53
53
2015-02-12
2015-02-12
10.11648/j.ajnc.s.2015040301.18
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.18
© Science Publishing Group
Secure Route Selection in Manet Using Ant Colony Optimization
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.19
A Mobile Adhoc network is a collection of nodes that are dynamically and arbitrarily located in such a manner that the inter connections between nodes are capable of changing on a continual basis. Ad hoc wireless networks are increasing in popularity, because of the spread of laptops, sensor devices, personal digital assistants, and other mobile electronic devices, these devices will eventually need to communicate with each other. For the implementation of MANET, the important factor which is concern is the routing of data from source to destination via various nodes as a mediator due to mobility of mobile nodes. Since the nodes are mobile, the network topology may change rapidly and unpredictably over time. The network topology is u structured and nodes may enter or leave at their will. For mobile ad hoc networks, the complexity of routing increases because of its characteristics such as dynamic topology, absence of centralized authority, time varying quality of service (QoS) requirements, etc. Ant Colony Optimization (ACO) algorithm uses mobile agents as ants to discover feasible and best path in a network. ACO helps in finding the paths between two nodes in a network and selection of path can be changed dynamically according to co dition of the wireless network in case of network congestion.
A Mobile Adhoc network is a collection of nodes that are dynamically and arbitrarily located in such a manner that the inter connections between nodes are capable of changing on a continual basis. Ad hoc wireless networks are increasing in popularity, because of the spread of laptops, sensor devices, personal digital assistants, and other mobile electronic devices, these devices will eventually need to communicate with each other. For the implementation of MANET, the important factor which is concern is the routing of data from source to destination via various nodes as a mediator due to mobility of mobile nodes. Since the nodes are mobile, the network topology may change rapidly and unpredictably over time. The network topology is u structured and nodes may enter or leave at their will. For mobile ad hoc networks, the complexity of routing increases because of its characteristics such as dynamic topology, absence of centralized authority, time varying quality of service (QoS) requirements, etc. Ant Colony Optimization (ACO) algorithm uses mobile agents as ants to discover feasible and best path in a network. ACO helps in finding the paths between two nodes in a network and selection of path can be changed dynamically according to co dition of the wireless network in case of network congestion.
Secure Route Selection in Manet Using Ant Colony Optimization
doi:10.11648/j.ajnc.s.2015040301.19
American Journal of Networks and Communications
2015-02-12
© Science Publishing Group
Somesh Maheshwari
Manish Bhardwaj
Secure Route Selection in Manet Using Ant Colony Optimization
4
3
56
56
2015-02-12
2015-02-12
10.11648/j.ajnc.s.2015040301.19
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.s.2015040301.19
© Science Publishing Group
Dependable Community-Cloud Framework for Smartphones
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150404.13
Cloud computing enable users to access ubiquitous, on-demand, convenient and shared resource (apps and storage) – as rapidly released by a provider with minimal managed effort. The increased growth of user access to mobile smartphones from 42.5% in 2013 to 78.9% by 2013 and the advent of Androids has made smartphones a preferred choice over PCs due to its design, portability, speed, functionality and Internet access ease – all of which continues to pose significant risk to user data security with high vulnerability to attacks. With its implication to work related functions and biz issues, it exposes sensitive data to adversaries. The study thus, describes a support tool named PushCloud that lets users account the ability to sign-in and perform backup functions on contacts, messages, picture files, documents, videos and recorded voice amongst others. Its other benefit is in the fact that it pools together cloud service providers and allows users a cross platform with minimal price difference. The system helps address security related issue from a user’s end via AES-256 encryption on an integrated cloud model, explores its storage capability to guarantee data recovery with a remote server (BDC) for back- and front-end data storage ease.
Cloud computing enable users to access ubiquitous, on-demand, convenient and shared resource (apps and storage) – as rapidly released by a provider with minimal managed effort. The increased growth of user access to mobile smartphones from 42.5% in 2013 to 78.9% by 2013 and the advent of Androids has made smartphones a preferred choice over PCs due to its design, portability, speed, functionality and Internet access ease – all of which continues to pose significant risk to user data security with high vulnerability to attacks. With its implication to work related functions and biz issues, it exposes sensitive data to adversaries. The study thus, describes a support tool named PushCloud that lets users account the ability to sign-in and perform backup functions on contacts, messages, picture files, documents, videos and recorded voice amongst others. Its other benefit is in the fact that it pools together cloud service providers and allows users a cross platform with minimal price difference. The system helps address security related issue from a user’s end via AES-256 encryption on an integrated cloud model, explores its storage capability to guarantee data recovery with a remote server (BDC) for back- and front-end data storage ease.
Dependable Community-Cloud Framework for Smartphones
doi:10.11648/j.ajnc.20150404.13
American Journal of Networks and Communications
2015-08-05
© Science Publishing Group
Arnold Adimabua Ojugo
Fidelis Obukowho Aghware
Rume Elizabeth Yoro
Mary Oluwatoyin Yerokun
Andrew Okonji Eboka
Christiana Nneamaka Anujeonye
Fidelia Ngozi Efozia
Dependable Community-Cloud Framework for Smartphones
4
4
103
103
2015-08-05
2015-08-05
10.11648/j.ajnc.20150404.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150404.13
© Science Publishing Group
Voice over IP End-to-End Delay Measurements
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150404.11
VoIP refers to a method of transmission of voice data over IP networks rather than using traditional circuit PSTN (Public Switched Telephone Networks ).In this paper the researcher discusses about VoIP, about the design issues of RTP/RTCP (real-time transport/real time control protocol), how to measure packet losses at the sender and receiver side and also inter-arrival delay and delay variation (Jitter) , how the receiver and sender sends reports about the sender , how one-way end-to-end delay is measured, and explains the functionalities of static and dynamic jitter buffers and describe how Cisco routers are used to measure packet losses and round trip delays for IP-SLA (Service level agreement).
VoIP refers to a method of transmission of voice data over IP networks rather than using traditional circuit PSTN (Public Switched Telephone Networks ).In this paper the researcher discusses about VoIP, about the design issues of RTP/RTCP (real-time transport/real time control protocol), how to measure packet losses at the sender and receiver side and also inter-arrival delay and delay variation (Jitter) , how the receiver and sender sends reports about the sender , how one-way end-to-end delay is measured, and explains the functionalities of static and dynamic jitter buffers and describe how Cisco routers are used to measure packet losses and round trip delays for IP-SLA (Service level agreement).
Voice over IP End-to-End Delay Measurements
doi:10.11648/j.ajnc.20150404.11
American Journal of Networks and Communications
2015-07-08
© Science Publishing Group
Binyam Shiferaw Heyi
Voice over IP End-to-End Delay Measurements
4
4
89
89
2015-07-08
2015-07-08
10.11648/j.ajnc.20150404.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150404.11
© Science Publishing Group
A Novel Hybrid Method for Face Recognition Based on 2d Wavelet and Singular Value Decomposition
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150404.12
An efficient face recognition system using eigen values of wavelet transform as feature vectors and radial basis function (RBF) neural network as classifier is presented. The face images are decomposed by 2-level two-dimensional (2-D) wavelet transformation.The wavelet coefficients obtained from the wavelet transformation are averaged for finding centers of features. In train process, four output of wavelet transform is analyzed and all eigenvalues of these images is obtained. At next step, the maximum 10 eigenvalues of wavelet sub images is stored as feature. Based on four sub images of wavelet transform and 10 eigenvalues of each sub image, the length of feature vector is 40. After obtaining features, in the train process for each person a center that has minimum Euclidean distance from all features is selected using RBF function. In fact the features are recognized by a RBF network. For a new input face image, firstly the feature vector is computed and then the distance (error) of this new vector with all centers of all persons is checked. The minimum distance is selected as target face. The proposed method on Essex face database and resultsshowed that the proposed method provide better recognition rates with low computational complexity.
An efficient face recognition system using eigen values of wavelet transform as feature vectors and radial basis function (RBF) neural network as classifier is presented. The face images are decomposed by 2-level two-dimensional (2-D) wavelet transformation.The wavelet coefficients obtained from the wavelet transformation are averaged for finding centers of features. In train process, four output of wavelet transform is analyzed and all eigenvalues of these images is obtained. At next step, the maximum 10 eigenvalues of wavelet sub images is stored as feature. Based on four sub images of wavelet transform and 10 eigenvalues of each sub image, the length of feature vector is 40. After obtaining features, in the train process for each person a center that has minimum Euclidean distance from all features is selected using RBF function. In fact the features are recognized by a RBF network. For a new input face image, firstly the feature vector is computed and then the distance (error) of this new vector with all centers of all persons is checked. The minimum distance is selected as target face. The proposed method on Essex face database and resultsshowed that the proposed method provide better recognition rates with low computational complexity.
A Novel Hybrid Method for Face Recognition Based on 2d Wavelet and Singular Value Decomposition
doi:10.11648/j.ajnc.20150404.12
American Journal of Networks and Communications
2015-07-08
© Science Publishing Group
Vahid Haji Hashemi
Abdorreza Alavi Gharahbagh
A Novel Hybrid Method for Face Recognition Based on 2d Wavelet and Singular Value Decomposition
4
4
94
94
2015-07-08
2015-07-08
10.11648/j.ajnc.20150404.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.ajnc.20150404.12
© Science Publishing Group
Aloha Based Resource Allocation Scheme to Efficient Call Holding Times in Public Safety Network
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.11
The allocation of limited resources such as links, servers, and agents to support as many as emergency call responses as possible while maintaining reasonable quality of service is a principal requirement in public safety networks. It is difficult to handle the highest priority emergency call responses for a congested period with a limited number of dedicated incoming links from commercial networks. Therefore, in this paper, we present the adaptive scheme based on a different call conversation time for an achieving efficient resource scheduling during a congested period without investing extra resources. The proposed adaptive scheduling approach improves accuracy of the network performance with the dynamic call holding time approach.
The allocation of limited resources such as links, servers, and agents to support as many as emergency call responses as possible while maintaining reasonable quality of service is a principal requirement in public safety networks. It is difficult to handle the highest priority emergency call responses for a congested period with a limited number of dedicated incoming links from commercial networks. Therefore, in this paper, we present the adaptive scheme based on a different call conversation time for an achieving efficient resource scheduling during a congested period without investing extra resources. The proposed adaptive scheduling approach improves accuracy of the network performance with the dynamic call holding time approach.
Aloha Based Resource Allocation Scheme to Efficient Call Holding Times in Public Safety Network
doi:10.11648/j.sjbm.s.2016050101.11
American Journal of Networks and Communications
2015-06-10
© Science Publishing Group
Tuyatsetseg Badarch
Otgonbayar Bataa
Bat-Enkh Oyunbileg
Aloha Based Resource Allocation Scheme to Efficient Call Holding Times in Public Safety Network
5
1
5
5
2015-06-10
2015-06-10
10.11648/j.sjbm.s.2016050101.11
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.11
© Science Publishing Group
On Basic Frequency and Harmony Parameters with Different Frequencies of Mongolian Traditional Musical Instruments
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.12
An instrument is a device that measures and/or regulates physical quantity/ process variables as flow, temperature, level, or pressure. Instruments include many varied contrivance that can be as simple as valves and transmitters, and as complex as analyzers. We are determining Mongolian basic five instruments’ electrical parameters, such as frequency and Hertz.
An instrument is a device that measures and/or regulates physical quantity/ process variables as flow, temperature, level, or pressure. Instruments include many varied contrivance that can be as simple as valves and transmitters, and as complex as analyzers. We are determining Mongolian basic five instruments’ electrical parameters, such as frequency and Hertz.
On Basic Frequency and Harmony Parameters with Different Frequencies of Mongolian Traditional Musical Instruments
doi:10.11648/j.sjbm.s.2016050101.12
American Journal of Networks and Communications
2015-06-10
© Science Publishing Group
Bat-Enkh Oyunbileg
Baatarkhuu Tsagaan
Chuluuntsetseg Jamyaan
Tuyatsetseg Badarch
Battugs Oyunbileg
On Basic Frequency and Harmony Parameters with Different Frequencies of Mongolian Traditional Musical Instruments
5
1
9
9
2015-06-10
2015-06-10
10.11648/j.sjbm.s.2016050101.12
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.12
© Science Publishing Group
Results of Simulation Program for Pathological Index relating the Climate Factors
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.13
To protect and prevent human health, this study calculated pathological index using weather factors such as air average temperature, average wind speed, average relative humidity and air pressure at days between 2004 and 2014 in Ulaanbaatar city of Mongolia. Then, we developed software program that calculates above mentioned pathology index, statistic parameters, and correlation.
To protect and prevent human health, this study calculated pathological index using weather factors such as air average temperature, average wind speed, average relative humidity and air pressure at days between 2004 and 2014 in Ulaanbaatar city of Mongolia. Then, we developed software program that calculates above mentioned pathology index, statistic parameters, and correlation.
Results of Simulation Program for Pathological Index relating the Climate Factors
doi:10.11648/j.sjbm.s.2016050101.13
American Journal of Networks and Communications
2015-06-18
© Science Publishing Group
Javzmaa Tsend
Bat-Enkh Oyunbileg
Ajnai Luvsan
S. Battulga
Results of Simulation Program for Pathological Index relating the Climate Factors
5
1
13
13
2015-06-18
2015-06-18
10.11648/j.sjbm.s.2016050101.13
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.13
© Science Publishing Group
Optimization Algorithm of Resource Allocation IEEE802.16m for Mobile WiMAX
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.14
Multi user resource allocation is one of the key features towards high speed wireless network based on Orthogonal Frequency Division Multiplexing Access (OFDMA). According to IEEE802.16m (Mobile WiMAX) standard resource allocation problem has to be performed on a frequency and time two-dimensional space with the Physical and logical resource units (PRU and LRU) including Distributed logical resource unit (DRU and CRU) and Contiguous logical resource unit In this paper we analysed the WiMAX frame structure in IEEE802.16m based on the Mobile WiMAX Standard. We apply novel resource allocation algorithm are used for managing two dimensional resources (time and frequency) to maximizing system capacity depending on mobile user’s data rate. This paper proposes a resource allocation algorithm for radio resource allocation in the downlink/uplink cellular networks using Orthogonal Frequency Division Multiple Access of Mobile WiMAX. Radio Resource Management (RRM) is fundamental in cellular networks. Many optimization problems involving allocation strategies of various types of resource appear in RRM. In this paper we determine the Fractional Frequency Reuse (FFR) and analyze the resources in Mobile WiMAX.
Multi user resource allocation is one of the key features towards high speed wireless network based on Orthogonal Frequency Division Multiplexing Access (OFDMA). According to IEEE802.16m (Mobile WiMAX) standard resource allocation problem has to be performed on a frequency and time two-dimensional space with the Physical and logical resource units (PRU and LRU) including Distributed logical resource unit (DRU and CRU) and Contiguous logical resource unit In this paper we analysed the WiMAX frame structure in IEEE802.16m based on the Mobile WiMAX Standard. We apply novel resource allocation algorithm are used for managing two dimensional resources (time and frequency) to maximizing system capacity depending on mobile user’s data rate. This paper proposes a resource allocation algorithm for radio resource allocation in the downlink/uplink cellular networks using Orthogonal Frequency Division Multiple Access of Mobile WiMAX. Radio Resource Management (RRM) is fundamental in cellular networks. Many optimization problems involving allocation strategies of various types of resource appear in RRM. In this paper we determine the Fractional Frequency Reuse (FFR) and analyze the resources in Mobile WiMAX.
Optimization Algorithm of Resource Allocation IEEE802.16m for Mobile WiMAX
doi:10.11648/j.sjbm.s.2016050101.14
American Journal of Networks and Communications
2015-06-30
© Science Publishing Group
Bat-Enkh Oyunbileg
Otgonbayar Bataa
Tuyatsetseg Badarch
Baatarkhuu Tsagaan
Optimization Algorithm of Resource Allocation IEEE802.16m for Mobile WiMAX
5
1
19
19
2015-06-30
2015-06-30
10.11648/j.sjbm.s.2016050101.14
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.14
© Science Publishing Group
A Malware Analysis Using Static and Dynamic Techniques
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.15
In this survey work we analyze “win 32 malware gen” it’s genre, procedure, harm using static and dynamic techniques. Static and dynamic methods were used to analyze a software program for any threats to the system. Static analysis involves testing its own source code and analyzing the threat itself, dynamic analysis involves specific secure, keeping threats within a system and analyzing the working progress of threats within the system
In this survey work we analyze “win 32 malware gen” it’s genre, procedure, harm using static and dynamic techniques. Static and dynamic methods were used to analyze a software program for any threats to the system. Static analysis involves testing its own source code and analyzing the threat itself, dynamic analysis involves specific secure, keeping threats within a system and analyzing the working progress of threats within the system
A Malware Analysis Using Static and Dynamic Techniques
doi:10.11648/j.sjbm.s.2016050101.15
American Journal of Networks and Communications
2015-08-08
© Science Publishing Group
Bymbadorj Dondogmegd
Usukhbayr B.
Nyamjav J.
A Malware Analysis Using Static and Dynamic Techniques
5
1
22
22
2015-08-08
2015-08-08
10.11648/j.sjbm.s.2016050101.15
http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=132&doi=10.11648/j.sjbm.s.2016050101.15
© Science Publishing Group