International Journal of Computer Communications and Networks (IJCCN)
E-ISSN 2289-3369 [Online] ISSN 2289-3350 [printed] International Journal of Computer Communication and Network (IJCCN) is a refereed open access international journal for scientific papers dealing in all areas of computer science research. The Journal of Computer Communication explores a wide range of emerging network technologies in computers as well as communication challenges in post-pc devices. The scope includes ad-hoc network, biological communication, protocols, security and more. The International Journal of Computer Communication and Network (IJCCN) is seeking for novel research works which implies great scientific work to push the boundaries of networking science. We are trying to include IJCCN into Thomson Master Journals and Scopus. On that regard, we are looking forward to great research results from your side. Thank you for your interest and contribution to IJCCN . International Journal of Computer Communications and Networks (IJCCN) | Call for papers (Due : Sep10, 2016) Publication Date : Oct 30, 2016 Submit : Manuscript Submission Volume Number: Vol.4, No.4
Authors who publish with this journal agree to the following terms: Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
ICT Innovation Strategy in Malaysia Public Research Institutes and Government Agencies
Information and Communication Technology (ICT) play important roles within the rapid growth of innovation environment. The roles include as a change agent, enhancing e-business requirements, promoting globalization and innovation, contributing to productivity growth, strengthening competitiveness, improving business processes along the whole value chain, determining future business strategies and generating profits for business. Previous studies have shown that by adopting ICT, the organization will attain positive impacts of innovation especially in product innovation, process innovation and competitive advantage. This indicates that ICT has significantly contributed towards promoting innovation in the organization. This paper presents the results of the study of ICT innovation in Malaysian Public Research Institute and Government Agencies (IPA). The study focuses on existing ICT strategies that promote innovation in IPA. Data was collected through questionnaires which were distributed to the selected Heads of IT in IPA. The findings of the study shows ICT innovation helped IPA in areas of creativity, product development, capacity development and strategic. This research also shows that IPA produced several ICT strategic applications for promoting innovation derived from ICT Strategic Plan (ICTSP). This research will help other research institutes to learn from each other and practice innovation in their organization.
Special Purpose and Application Based Systems
HCERHSW: A Hierarchical, Clustering-based and Energy-aware Routing Algorithm for Homogenous and Static Wireless Sensor Networks
Wireless sensor networks (WSNs) are new generation of wireless networks which have many potential applications and unique challenges. Some of their most important problems are their hard organization and management, limited resources, dynamic topology and low scalability. Also, maximum of energy consumption into these networks is occurred when transmitting data between network components. One significant technique against to these problems is data transmission by using of hierarchical, clustering-based and energy-aware routing protocols; they lead to more scalability, energy efficiency, prolonged network lifetime and easy management of large-scale WSNs. As a result, this paper is focused on proposing a hierarchical, clustering-based and energy-aware routing algorithm for homogenous and static WSNs which it called HCERHSW.
Communication protocol in Wireless Sensor Networks
Cloud Computing and its Leveling Impact between Developed and Emerging Economies
This paper looks at Cloud Computing as a new wave technology option and the leveling impact that it has got between developed and emerging economies. The paper analyses the four vectors of threat for cloud computing adoption using the tetra-threat framework, a structure that analyses the sustainability of competitive advantage. In the context of emerging economies, the paper explains the cloud acceptance patterns of predominantly ‘new customer’ emerging markets with two counties in perspective – India a BRIC nation and Indonesia a MIST nation.
Information Security: Human Resources Management and Information Security Incident Management
Information security has becomes an essential aspect in any organization. Since most of the sensitive information is stored digitally, security becomes extremely important and need to be managed and protected on an ongoing basis. Information security management recognizes the most susceptible area in any organization and builds shields to protect them. Â Â Â Due to the important of information assets, a study have been conducted to explore whether information security in UNISEL comply with what has been recommended by the code of practice focusing in the area of human resource management and information security incident management. Â This paper presents the result from a combination of quantitative and qualitative study, arising from detailed interviews conducted with a few head of departments and unit to get their view, opinion and experiences with information security management as well as a questionnaire to identify the level of awareness among staff. The findings reveal that the needs for human resources management and information security incident are required to protect information assets of an organization.
Adaptive Cluster Head probability for LEACH protocol
<!--[if gte mso 9]><xml> <w:WordDocument> <w:View>Normal</w:View> <w:Zoom>0</w:Zoom> <w:TrackMoves /> <w:TrackFormatting /> <w:PunctuationKerning /> <w:ValidateAgainstSchemas /> <w:SaveIfXMLInvalid>false</w:SaveIfXMLInvalid> <w:IgnoreMixedContent>false</w:IgnoreMixedContent> <w:AlwaysShowPlaceholderText>false</w:AlwaysShowPlaceholderText> <w:DoNotPromoteQF /> <w:LidThemeOther>EN-US</w:LidThemeOther> <w:LidThemeAsian>X-NONE</w:LidThemeAsian> <w:LidThemeComplexScript>X-NONE</w:LidThemeComplexScript> <w:Compatibility> <w:BreakWrappedTables /> <w:SnapToGridInCell /> <w:WrapTextWithPunct /> <w:UseAsianBreakRules /> <w:DontGrowAutofit /> <w:SplitPgBreakAndParaMark /> <w:DontVertAlignCellWithSp /> <w:DontBreakConstrainedForcedTables /> <w:DontVertAlignInTxbx /> <w:Word11KerningPairs /> <w:CachedColBalance /> </w:Compatibility> <w:BrowserLevel>MicrosoftInternetExplorer4</w:BrowserLevel> <m:mathPr> <m:mathFont m:val="Cambria Math" /> <m:brkBin m:val="before" /> <m:brkBinSub m:val=" " /> <m:smallFrac m:val="off" /> <m:dispDef /> <m:lMargin m:val="0" /> <m:rMargin m:val="0" /> <m:defJc m:val="centerGroup" /> <m:wrapIndent m:val="1440" /> <m:intLim m:val="subSup" /> <m:naryLim m:val="undOvr" /> </m:mathPr></w:WordDocument> </xml><![endif]--> LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head. The LEACH [1] protocol is an elegant solution to data collection problem, where a small number of clusters are formed in a self-organized manner. Generally nodes consume more energy as cluster head than non-cluster head for transmitting the data. This energy consumption also increases as distance increases from Base Station (BS). So, assigning the same probability for electing as Cluster Head for all the nodes can lead to uneven energy consumption. In this paper, we proposed Distance based probability for Cluster Head election (D-LEACH) to make uniform energy consumption of Cluster Heads (CHs), which makes the routing protocol more energy efficient and prolongs life time of a wireless sensor network. Simulation results show that D-LEACH improves network life time compared to LEACH. <!--[if gte mso 9]><xml> <w:LatentStyles DefLockedState="false" DefUnhideWhenUsed="true" DefSemiHidden="true" DefQFormat="false" DefPriority="99" LatentStyleCount="267"> <w:LsdException Locked="false" Priority="0" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Normal" /> <w:LsdException Locked="false" Priority="9" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="heading 1" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 2" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 3" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 4" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 5" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 6" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 7" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 8" /> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 9" /> <w:LsdException Locked="false" Priority="39" Name="toc 1" /> <w:LsdException Locked="false" Priority="39" Name="toc 2" /> <w:LsdException Locked="false" Priority="39" Name="toc 3" /> <w:LsdException Locked="false" Priority="39" Name="toc 4" /> <w:LsdException Locked="false" Priority="39" Name="toc 5" /> <w:LsdException Locked="false" Priority="39" Name="toc 6" /> <w:LsdException Locked="false" Priority="39" Name="toc 7" /> <w:LsdException Locked="false" Priority="39" Name="toc 8" /> <w:LsdException Locked="false" Priority="39" Name="toc 9" /> <w:LsdException Locked="false" Priority="35" QFormat="true" Name="caption" /> <w:LsdException Locked="false" Priority="10" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Title" /> <w:LsdException Locked="false" Priority="1" Name="Default Paragraph Font" /> <w:LsdException Locked="false" Priority="11" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Subtitle" /> <w:LsdException Locked="false" Priority="22" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Strong" /> <w:LsdException Locked="false" Priority="20" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Emphasis" /> <w:LsdException Locked="false" Priority="59" SemiHidden="false" UnhideWhenUsed="false" Name="Table Grid" /> <w:LsdException Locked="false" UnhideWhenUsed="false" Name="Placeholder Text" /> <w:LsdException Locked="false" Priority="1" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="No Spacing" /> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading" /> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List" /> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid" /> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1" /> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2" /> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1" /> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2" /> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1" /> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2" /> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3" /> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List" /> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading" /> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List" /> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid" /> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 1" /> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 1" /> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 1" /> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 1" /> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 1" /> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 1" /> <w:LsdException Locked="false" UnhideWhenUsed="false" Name="Revision" /> <w:LsdException Locked="false" Priority="34" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="List Paragraph" /> <w:LsdException Locked="false" Priority="29" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Quote" /> <w:LsdException Locked="false" Priority="30" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Intense Quote" /> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 1" /> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 1" /> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 1" /> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 1" /> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 1" /> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 1" /> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 1" /> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 1" /> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 2" /> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 2" /> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 2" /> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 2" /> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 2" /> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 2" /> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 2" /> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 2" /> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 2" /> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 2" /> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 2" /> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 2" /> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 2" /> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 2" /> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 3" /> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 3" /> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 3" /> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 3" /> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 3" /> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 3" /> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 3" /> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 3" /> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 3" /> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 3" /> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 3" /> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 3" /> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 3" /> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 3" /> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 4" /> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 4" /> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 4" /> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 4" /> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 4" /> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 4" /> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 4" /> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 4" /> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 4" /> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 4" /> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 4" /> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 4" /> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 4" /> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 4" /> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 5" /> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 5" /> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 5" /> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 5" /> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 5" /> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 5" /> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 5" /> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 5" /> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 5" /> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 5" /> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 5" /> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 5" /> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 5" /> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 5" /> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 6" /> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 6" /> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 6" /> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 6" /> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 6" /> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 6" /> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 6" /> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 6" /> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 6" /> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 6" /> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 6" /> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 6" /> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 6" /> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 6" /> <w:LsdException Locked="false" Priority="19" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Subtle Emphasis" /> <w:LsdException Locked="false" Priority="21" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Intense Emphasis" /> <w:LsdException Locked="false" Priority="31" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Subtle Reference" /> <w:LsdException Locked="false" Priority="32" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Intense Reference" /> <w:LsdException Locked="false" Priority="33" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Book Title" /> <w:LsdException Locked="false" Priority="37" Name="Bibliography" /> <w:LsdException Locked="false" Priority="39" QFormat="true" Name="TOC Heading" /> </w:LatentStyles> </xml><![endif]--><!--[if gte mso 10]> <mce:style><! /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} -->
Safeguarding the Cloud: An Effective Risk Management Framework for Cloud Computing Services
Cloud computing services have attracted the attention of many organizations seeking flexible, simple, and efficient system development, operation, and support. The cost advantages of cloud services motivate the outsourcing of IT systems to the cloud. However, there is a lack of awareness of the security risks associated with cloud services. These risks and the associated threats could jeopardize the success and even the survivability of organizations that adopt cloud services. To address this issue, a risk management framework is proposed in this paper which leverages the previously proposed security operations center as a service (SOCaaS) combined with a secure service level agreement (SecSLA) to provide security requirements and compliance. The framework is self-aware of the organization assets and the associated security risks and vulnerabilities. Automated tools are provided to identify, classify, evaluate, and control the information security and data privacy of cloud systems and services. The proposed framework supports cloud protection by identifying threats and vulnerabilities in cloud systems and recommending steps to ensure their confidentiality, integrity, and availability (CIA).
An Introduction to Undetectable Keyloggers with Experimental Testing
Abstract. Keyloggers are used as a tools by attacker to steel user’s usernames and passwords in e-commerce, Social network, Mail service and etc. There are many security software for detecting keyloggers and some technique have introduce for dealing with them. In this paper we will show that keyloggers can be undetectable from security software. We will make a keylogger and then will change the structure of keylogger then test it against popular security software in the world. At final we will show that many security software cannot detect keyloggers. Our goal is to introduce this new challenge.
The Use of Digital Image Processing in Maximum Utilization of Rice Fields
Currently the utilization of digital image processing very much especially in the field of production. In relation to agricultural land, digital image processing is used to maximize the effectiveness of the land, in order to find out how big the effectiveness of land uses in the field of agriculture. In this paper to address the problem, then the unambiguous euclidean distance method and prediction of land use using the approach at an average age of rice plant. With the utilization of these methods were later expected to help maximization the use of agricultural land.
EMPLOYEE PERFORMANCE EVALUATION USING MACHINE LEARNING ALGORITHM
The main objective is to provide the performance appraisal report of an employee using Decision Tree algorithm. The data mining classification methods like decision tree, rule mining, clustering etc. can be applied for evaluating the employee data for giving promotion, yearly increment and career advancement. In order to provide yearly increment for an employee, the historical data stored in the table are subjected to learning by using the decision tree algorithm and the performance are found by testing the attributes of an employee against the rules generated by the decision tree classifier. This paper concentrates on collecting data about employees using the user interface, generating a decision tree from the historical data, testing the decision tree with attributes of an employee and generating the output as whether to give the promotion or not. The information of the user is compared with the trained data stored in the decision tree. The final goal node is to determine whether the employee will get yearly increment, promotion or not.
Computer Science and Artificial Intelligence
FRAMEWORK FOR INTELLIGENT NETWORK DESIGN
Designing a network can be a challenging task. A network that consists of only 50 meshed routing nodes can pose complex problems that lead to unpredictable results. Attempting to optimize networks that feature thousands of nodes can pose even more complex problems. In this paper, we propose network design framework to simplify the complexities associated with analyzing customer network problems and creating scalable solutions which can provide suggestions to the network designer to use frameworks for a particular network design. This framework may also act as a network analyzer to suggest various steps to be implemented to improve the performance of the current network.
DESIGN AND DEVELOPMENT OF REAL TIME TRACKING OF HUMAN FACES SECURITY IDENTIFICATION SYSTEM
Robust tracking of persons in real-world environments and in real-time is a common goal in many video applications. In this paper a computational system for the real-time tracking of multiple persons in natural environments is presented. Face detection has diverse applications especially as an identification solution which can meet the crying needs in security areas. The region extractor is based on the integration of skin-color, motion and silhouette features, while the face detector uses a simple, rule-based face detection algorithm and SVM. Exemplary results of the integrated system working in real-world video sequences. New intelligent processing methods, as well as security requirements make multiple-person tracking a hot area. This application is robust tracking in real-world environments and in real-time.
A Comprehensive Comparison of Attacks in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are vulnerable to different kinds of attacks and most of traditional networks security techniques are unusable on WSNs; due to untrusted transmissions, deployment in open and hostile environments, unattended nature and limited resources. So, security is a vital and complex requirement for these networks. This paper focuses on security of WSNs and its main purpose is discussing on WSNs' attacks in different layers, including of physical layer attacks, link layer attacks, routing layer attacks, transport layer attacks and application layer attacks. It classifies and compares different attacks based on their nature and goals; i.e. this paper is expressing purpose and capabilities of attackers and it is presenting goals and result of different attacks on WSNs.
Privacy-preserving Data Mining for Personalized Marketing
In electronic commerce markets, firms can easily achieve customers’ personal information such as identity, demographic information, and shopping behavior. Researches in securing statistical database had introduced several tools and methods to secure such statistical database with sensitive personal information. Although the data perturbation methods secure the database very effectively, it is not applicable to the application beyond the simple statistical analysis on means, variances and covariance. In this paper, I suggest Multiple Staged Slice Perturbation Methods in order to apply them to RFM analysis. My study shows the possibility of applying a simple modification to perturbation methods in order to be able to perform the RFM analysis. My method of slicing the database into decile and perturbing each decile separately would maintain the mean and the standard deviation of each decile. I showed that current data security methods may not be applicable to some business analysis that deals with more than the mean, standard deviation and covariance between variables. Since perturbation method guarantees protection against exact disclosure, there is no threat of exact disclosure even if data is partitioned into small pieces and perturbed individually. However, because partitioning limits range of shuffling effect, partial disclosure is possible. Therefore, for achieving the maximum utility while preserving maximum security level, the number of partition should be minimized.
BINARY CAM WITH CSC TO REINSTATE ATM SWITCH IN ASYNCHRONUS TRANSFER MODE
For packet forwarding and packet classification in networks such as Internet high speed routers are necessary. Now-a-days CAMs are used for this purpose. The Content Addressable Memory (CAM) is a search engine that uses the content of the word to search in the memory. The CAM use up more power during every search operation. Hence, it is vital to reduce power consumption in CAMs. search buss and match buss in CAMs are the major sources of power consumption. Hence, in my project current control blocks are added to each match buss to reduce power consumption. Also parity bits are used find the matched word and reduce the comparison with the miss-matched word. By this way the total power consumption in CAM is reduced to 0.009watts when compared with already existing schemes. CAMs can be used in Asynchronous Transfer Mode (ATM) switching network components as a translation table. CAM can act as an address translator in an ATM switch and perform the VPI/VCI translation very quickly. During the translation process, the CAM takes incoming VPI/VCI values in ATM cell headers and generates addresses that access data in an external RAM.
Distributed Adaptive Sleep Scheduling Algorithm for Enhancing Energy Efficiency in Wireless Sensor Networks based on L-PEDAP Protocol
The research work presented in this paper introduces distributed adaptive sleep scheduling algorithm to increase performance on high density wireless sensor networks. It also re-computes routing tree spanning only with active nodes. The proposed works on top the existing work of Localized Power Efficient Data Aggregation Protocols (L-PEDAP), which is self organizing, robust and energy efficient data aggregation tree approach. The topologies adopted for the simulation environment are LMST and RNG. Both LMST and RNG work on approximate minimum spanning tree and efficiently compute energy metrics using only position or distance information of one-hop neighbors. The actual routing tree is constructed over these topologies. Different parent selection strategies are evaluated with the proposed scheme of sleep scheduler modes, while constructing a routing tree. Then compare each topology and parent selection strategy and conclude that the best among them is shortest path strategy over LMST structure. The proposed solution also involves route maintenance procedures that will be executed when a sensor node fails or a new node is added to the network. The proposed solution is also adapted to consider the remaining power levels of nodes in order to increase the network lifetime.
IMAGE PROCESSING AND FACE DETECTION SYSTEM WITH FACE RECOGNITION BASED FACE ALGORITHM EIGENVECTORS PRINCIPAL COMPONENT ANALYSIS (PCA)
The face is one of the easiest ways to distinguish the individual identity of each other. Face recognition is a personal identification system that uses personal characteristics of a person to identify the person's identity. Human face recognition procedure basically consists of two phases, namely face detection, where this process takes place very rapidly in humans, except under conditions where the object is located at a short distance away, the next is the introduction, which recognize a face as individuals. Stage is then replicated and developed as a model for facial image recognition (face recognition) is one of the much-studied biometrics technology and developed by experts. There are two kinds of methods that are currently popular in developed face recognition pattern namely, Eigenface method and Fisherface method. Facial image recognition Eigenface method is based on the reduction of face-dimensional space using Principal Component Analysis (PCA) for facial features. The main purpose of the use of PCA on face recognition using eigenfaces was formed (face space) by finding the eigenvector corresponding to the largest eigenvalue of the face image.
LTE system performance enhanced through interference reduction techniques
Orthogonal Frequency Division Multiplexing Access has been increasingly deployed in emerging and evolving cellular system to reduce interference .However, in these systems inter cell interference still occur a real challenge that limits the system performance. Soft Fractional Reuse technique is proposed to overcome the co-channel interference through dividing total available bandwidth into primary and secondary segment. In this paper combining the SFR technique and optimally allocating the sub-band to end users which increases the system performance
Online Secure Electronic Passport Scheme using Cryptographic Authentication Protocols and Biometrics Technology
Electronic passports (e-Passports) have known a wide and fast deployment all around the world since the International Civil Aviation Organization (ICAO) the world has adopted standards whereby passports can store biometric identifiers. The purpose of biometric passports is to prevent the illegal entry of traveler into a specific country and limit the use of counterfeit documents by more accurate identification of an individual. The e-passport, as it is sometimes called, represents a bold initiative in the deployment of two new technologies: Cryptography security and multiple biometrics (face, fingerprints, palm prints and iris). A passport contains the important personal information of holder such as photo, name, date of birth and place, nationality, date of issue, date of expiry, authority and so on. Â The goal of the adoption of the electronic passport is not only to expedite processing at border crossings, but also to increase security. Important in their own right, e-passports are also the harbinger of a wave of next-generation e-passport: several national governments plan to deploy e-passport integrating cryptography algorithm and multiple biometrics. Researchers explore the privacy and security implications of this impending worldwide experiment in multiple biometrics authentication technology. Researcher describes privacy and security issues that apply to e-passports, and then analyze these issues in the context of the International Civil Aviation Organization standard for e-passports. An overall security process that involves people, technology and procedures can overcome limitations of the Cryptography security and multiple biometric technologies.
EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks
Optimizing location of controllers in wireless networks is an important problem in the cellular mobile networks designing. In this paper, I present two algorithms based on Evolutionary Algorithm (EA) and Ant Colony Optimization (ACO) to solve it. In the first algorithm, my objective function is determined by the total distance based on finding maximum flow in a bipartite graph using Ford-Fulkerson algorithm. In the second algorithm, I generate pheromone matrix of ants and calculate the pheromone content of the path from controller i to base station j using the neighborhood includes only locations that have not been visited by ant k when it is at controller i. At each step of iterations, I choose good solutions satisfying capacity constraints and update step by step to find the best solution depending on my cost functions. I evaluate the performance of my algorithms to optimize location of controllers in wireless networks by comparing to SA, SA-Greedy, LB-Greedy algorithm. Numerical results show that my algorithms proposed have achieved much better more than other algorithms
Introduction and Security Analysis to Digital Video Broadcasting - Handheld
DVB-H (Digital Video Broadcasting - Handheld) is the mobile TV standards, which is widely used in European countries and many others. It is a technical specification for bringing broadcast services to mobile handsets and plays a very significant role in the modern day Mobile-TV. Unfortunately, threats to the security of its network and communication systems are not usually main concerns. In this paper, security threats of the DVB-H system as well as possible mitigations are reviewed
Receipt-Free Electronic Voting Scheme with Smart Card Using Blind Signature
Voting is regarded as one of the most effective methods for individuals to express their opinions to select their democratic leader in the public elections. As the computing, communicating, and cryptographic techniques progress rapidly, increasing emphasis has been placed on developing electronic voting schemes capable of providing more efficient voting services than conventional paper-based voting methods. A receipt-free e-voting scheme based on the virtual voting booth that can be implemented with a smart card. Receipt-freeness is achieved by distributing the voting procedure between the voter and the smart card. By using smart cards to randomize part of content of the ballot, the voter cannot construct a receipt. The voter and the smart card jointly contribute randomness for the encryption of the ballot. To provide convenience to voters, sufficient voting facilities are supplied in sufficient public voting booths.
FCA - An Approach On LEACH Protocol Of Wireless Sensor Networks Using Fuzzy Logic
In order to gather information more efficiently, wireless sensor networks are partitioned into clusters. Themost of the proposed clustering algorithms do not consider the location of the base station. This situation causes hotspots problem in multi-hop wireless sensor networks. In this paper, we propose a fuzzy clustering algorithm (FCA) whichaims to prolong the lifetime of wireless sensor networks. FCA adjusts the cluster-head radius considering the residualenergy and the distance to the base station parameters of the sensor nodes. This helps decreasing the intra-clusterwork of the sensor nodes which are closer to the base station or have lower battery level. We utilize fuzzy logic forhandling the uncertainties in cluster-head radius estimation. We compare our algorithm with LEACH according to firstnode dies, half of the nodes alive and energy-efficiency metrics. Our simulation results show that FCA performs betterthan other algorithms in most of the cases. Therefore, our proposed algorithm is a stable and energy-efficient clusteringalgorithm.
Newsroom play a very significant role in the modern day news production, and a vast array of technological advancement is being introduced to improve communication efficiency but surprisingly, threats to the security of the network and communication channel, server systems, and work stations ; external and internal alike, of the newsroom are often overlooked/neglected. This threats if not mitigated could compromise the security of the newsroom and consequently jeopardize the integrity, reputation and even the safety of journalist. This survey studied the possible threats to newsroom and its possible effect, as well as possible mitigation to these threats.
Comparative Performance Analysis of AODV, DSR,DYMO,OLSR and ZRP Routing Protocols in MANET Using Varying Pause Time
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration. In MANET, due to mobility of nodes network topology changes frequently and thus, routing becomes a challenging task. A variety of routing protocols with varying network conditions are analyzed to find an optimized route from a source to some destination. This article presents performance comparison of five popular mobile ad-hoc network routing protocols i.e. Ad hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), Dynamic MANET on- Demand (DYMO), Optimization Link State Routing (OLSR) and Zone Routing Protocol (ZRP) in variable pause time. We used well known network simulator QualNet 5.0.2 from scalable networks to evaluate the performance of these protocols. The performance analysis is based on different network metrics such as End to End delay (s), Average Jitter (s), First Packet Receive (FPR), Last Packet Receive (LPR), Total Bytes Receive (TBR) and Total Packet Receive (TPR).
Abstract— nowadays, a number of wireless users, network technologies and applications are in growth. This phenomenon brought up abundant with services to the human everyday tasks and activities, with simplicity, and minimal technical expertise. The great move from virtual to augmented reality changes people's life, and makes daily activity seamless without burden. In such an environment, the possibility of collecting information invisibly without user's intention is very high. The nature of the interaction between users necessitates a trust concept, which required integration of different concepts to evaluate precisely the trustworthiness of each user. This work provides a scoring mechanism that gives the user a degree by implementing a fusion of support vector machine and fuzzy logic to calculate efficiently the trust score, and resolved the uncertainty in the decision.
Abstract— Mobile wireless sensor networks (MWSNs) have recently launched a growing popular class of WSN in which mobility plays a key role in the execution of the application. In recent years, mobility has become an important area of research for the WSN community. The increasing capabilities and the decreasing costs of mobile sensors make now mobile sensor networks possible and practical. Although WSN deployments were never envisioned to be fully static, mobility was initially regarded as having several challenges that needed to be overcome, including connectivity, coverage, and energy consumption, among others.However, recent studies have been showing mobility in a more favorable light. In this article an overview of proposals that evaluate mobile communication in WSNs is presented.
Secure Hierarchal Routing Protocols in Wireless Sensor Networks; Security Survey Analysis
Wireless Sensor Network is consisting of number of limited sensor devices which are communicated over the wireless media. There are a lot of its application in military, health and industry. As sensor devices are resource restricted, the networks exposed to different types of attacks and conventional techniques against these attacks are not desirable due to the resource constrained nature of these kinds of networks. Therefore, security in WSNs is a challenging task due to inheritance limitations of sensors and it becomes a good topic for researchers. In this paper we focus at secure hierarchal routing protocols in wireless sensor networks and represent selected approaches which focusing at this matter. Finally we develop a matrix which generalizes previous works and analyze the proposed matrix and then suggests the protocols to be applied in proper application.
Segmentation-based On-Demand Burst Rescheduling Algorithm for Optical Burst Switched Networks
Optical Burst Switching (OBS) is a type of switching technology capable of harnessing the Wavelength Division Multiplexing (WDM) capability by aggregating different client packets into larger packets known as bursts. OBS is a promising candidate for near-future all-optical networks. However, large burst loss at the core node due to contention is a key issue and it is caused by the bufferless nature of OBS architecture. This paper focuses on scheduling as a means to reduce contention and improve the overall network performance in terms of loss and throughput. Two important design criteria for scheduling algorithms are speed and link utilization. These criteria are not supported in current scheduling algorithms due to the trade-off between control packet processing speed and efficient utilization of the bandwidth resource. In this paper, a Segmentation-based On-Demand Burst Rescheduling Algorithm (SODBRA) is proposed and evaluated. In SODBRA, the aforementioned trade-off is balanced by hybridizing First-Fit Unscheduled Channel (FFUC) with void filling scheme. The proposed scheduling algorithm was evaluated using the NCTUns 6.0 event driven simulator and emulator. The results obtained show that SODBRA does reduce burst loss probability, increase network throughput and outperforms most of the existing scheduling schemes especially as the load and the number of wavelength increases.
Triangle Area Segmentation for Coverage Measurement in Wireless Sensor Networks
Sensing coverage is one of the principal trade-off factors in Wireless Sensor Network design. It is necessary to have a minimum bound of sensing coverage in a sensor network in various aspects like scheduling, target tracking or redeployment phases. There are several methods to determine the sensing coverage. However, a system to provide detailed information about the coverage is still missing. In this paper, we propose a new coverage measurement method using Delaunay Triangulation (DT) that it can provide the coverage value and density distribution of sensors including the number of sensors in dense areas, scattered areas and as well as the number of sensors on the borders among those areas. The simulation results show that the proposed DT method can obtain accurate knowledge of the sensing coverage.
Optimization of Wireless Sensor Network Coverage based on Evolutionary Algorithm
Wireless sensor Network(WSN) has newly drawn lots of attention due to its application in the medical, environment, military and industry. Due to maximum coverage, sensor node has mobility for improving network coverage in the wireless sensor network. The spatially distributed sensor nodes collect from the environment through the movement. Mobility of sensor is based on connectivity and optimizes the coverage on whole target area. Finding near optimal solutions for sensor deployment is issued in Wireless sensor networks (WSN). Optimum deployment of the sensor nodes is favorable to the largest potential utilization of the sensor network. Optimization deployment of the mobile sensor provides fault tolerance in WNSN that can help network prolonging the lifetime, reduce the size of complexity and increase the quality of service (QoS) especially for WSNs applications. Wireless sensor deployment problem, by using the power of Particle Swarm Optimization (PSO) in order to minimize movement of the mobile node and increase the lifetime of the network while optimizing the network coverage.