Knowledge sharing through virtual layers in regional sustainable development networks

Our research examines how the organisational structure facilitates knowledge sharing within the group. This case study examines a Victorian regional sustainable group using interviews and social network analysis to identify the group’s organisational structure and its effect on knowledge sharing between the members. Our findings indicate that while the mixed membership, lack of hierarchy and layered structure are complex, these elements work together to provide members with a rich body of knowledge. The diversity and differences in membership are complimentary and combined can provide a more in-depth understanding of the regional sustainable development issues.

Guest editorial : In Journal of networks, v.6 n.1

In recent years, networking of computing devices has been going through rapid evolution and thus continuing to be an ever expanding area of importance. Different technologies, protocols, services and usage patterns have contributed to the major research interests in this area of computer science. The current special issue is an effort to bring forward some of these interesting developments that are being pursued by researchers at present in different parts of the globe. Our objective is to provide the readership with some insight into the latest innovations in computer networking through this.

Designing for learning : online social networks as a classroom environment

This paper deploys notions of emergence, connections, and designs for learning to conceptualize high school students’ interactions when using online social media as a learning environment. It makes links to chaos and complexity theories and to fractal patterns as it reports on a part of the first author’s action research study, conducted while she was a teacher working in an Australian public high school and completing her PhD. The study investigates the use of a Ning online social network as a learning environment shared by seven classes, and it examines students’ reactions and online activity while using a range of social media and Web 2.0 tools.

The authors use Graham Nuthall’s (2007) “lens on learning” to explore the social processes and culture of this shared online classroom. The paper uses his extensive body of research and analyses of classroom learning processes to conceptualize and analyze data throughout the action research cycle. It discusses the pedagogical implications that arise from the use of social media and, in so doing, challenges traditional models of teaching and learning.

Implementing recovery in low-resource stationary wireless sensor networks

Implementation of certain types of protocols on wireless sensor networks (WSNs) can be difficult due to the architecture of the motes. Identification of these issues and recommendations for workarounds can be very useful for the WSN research community testing hardware. In recent work, the authors developed and implemented clustering, reprogramming and authentication protocols involved in recovering WSNs with low resources. In attempting to integrate these protocols, several issues arose in the implementation phase connected to pre-set configurations of the motes used. In this paper, we describe the issues arising in integrating our protocols using Zigbee with IEEE 802.15.4 and the reprogramming module Deluge, and compare our challenges and solutions with those faced by other researchers in this area. Finally, we provide recommendations for consideration by researchers who may in future consider integrating several protocols on these platforms.

Leadership to improve mathematics outcomes in low SES schools and school networks

Instructional and transformational leadership is reportedly required to improve the mathematics outcomes of students in low socio-economic status school communities. This study of 43 schools in two networks of schools in rural Victoria explored leadership practices and found evidence to support both these leadership approaches along with distributed leadership practice. School leaders established network and school structures and relationships at various levels of the network and school organisation to enable and support ongoing improvement in teachers’ pedagogical content knowledge and teaching practice and to build the leadership capacity of teachers within their schools. The leaders’ knowledge of effective mathematics teaching practice enabled them to mentor teachers in their school or team and to support the practices of professional learning teams within their school.

Trust mechanisms in wireless sensor networks : attack analysis and countermeasures

As the trust issue in wireless sensor networks is emerging as one important factor in security schemes, it is necessary to analyze how to resist attacks with a trust scheme. In this paper we categorize various types of attacks and countermeasures related to trust schemes in WSNs. Furthermore, we provide the development of trust mechanisms, give a short summarization of classical trust methodologies and emphasize the challenges of trust scheme in WSNs. An extensive literature survey is presented by summarizing state-of-the-art trust mechanisms in two categories: secure routing and secure data. Based on the analysis of attacks and the existing research, an open field and future direction with trust mechanisms in WSNs is provided.

Building genetic networks using relatedness information : a novel approach for the estimation of dispersal and characterization of group structure in social animals

Natal dispersal is an important life history trait driving variation in individual fitness, and therefore, a proper understanding of the factors underlying dispersal behaviour is critical to many fields including population dynamics, behavioural ecology and conservation biology. However, individual dispersal patterns remain difficult to quantify despite many years of research using direct and indirect methods. Here, we quantify dispersal in a single intensively studied population of the cooperatively breeding chestnut-crowned babbler (Pomatostomus ruficeps) using genetic networks created from the combination of pairwise relatedness data and social networking methods and compare this to dispersal estimates from re-sighting data. This novel approach not only identifies movements between social groups within our study sites but also provides an estimation of immigration rates of individuals originating outside the study site. Both genetic and re-sighting data indicated that dispersal was strongly female biased, but the magnitude of dispersal estimates was much greater using genetic data. This suggests that many previous studies relying on mark–recapture data may have significantly underestimated dispersal. An analysis of spatial genetic structure within the sampled population also supports the idea that females are more dispersive, with females having no structure beyond the bounds of their own social group, while male genetic structure expands for 750 m from their social group. Although the genetic network approach we have used is an excellent tool for visualizing the social and genetic microstructure of social animals and identifying dispersers, our results also indicate the importance of applying them in parallel with behavioural and life history data.

Unicast and broadcast throughput maximization in amplify-and-forward relay networks

Cooperative communication (CC) offers an efficient and low-cost way to achieve spatial diversity by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of CC. Most existing relay selection strategies focus on optimizing the outage probability or energy consumption. To fill in the vacancy of research on throughput improvement via CC, we study the relay selection problem with the objective of optimizing the throughput in this paper. For unicast, it is a P problem, and an optimal relay selection algorithm is provided with a correctness proof. For broadcast, we show the challenge of relay selection by proving it nonprobabilistic hard (NP-hard). A greedy heuristic algorithm is proposed to effectively choose a set of relay nodes that maximize the broadcast throughput. Simulation results show that the proposed algorithms can achieve high throughput under various network settings.

Guest editorial : In Journal of networks, v.7 n.3

Networking of computing devices has been going through rapid evolution and thus continuing to be an ever expanding area of importance in recent years. New technologies, protocols, services and usage patterns have contributed to the major research interests in this area of computer science. The current special issue is an effort to bring forward some of these interesting developments that are being pursued by researchers at present in different parts of the globe. Our objective is to provide the readership with some insight into the latest innovations in computer networking through this. This Special Issue presents selected papers from the thirteenth conference of the series (ICCIT 2010) held during December 23-25, 2010 at the Ahsanullah University of Science and Technology. The first ICCIT was held in Dhaka, Bangladesh, in 1998. Since then the conference has grown to be one of the largest computer and IT related research conferences in the South Asian region, with participation of academics and researchers from many countries around the world. Starting in 2008 the proceedings of ICCIT are included in IEEExplore. In 2010, a total of 410 full papers were submitted to the conference of which 136 were accepted after reviews conducted by an international program committee comprising 81 members from 16 countries. This was tantamount to an acceptance rate of 33%. From these 136 papers, 14 highly ranked manuscripts were invited for this Special Issue. The authors were advised to enhance their papers significantly and submit them to undergo review for suitability of inclusion into this publication. Of those, eight papers survived the review process and have been selected for inclusion in this Special Issue. The authors of these papers represent academic and/or research institutions from Australia, Bangladesh, Japan, Korea and USA. These papers address issues concerning different domains of networks namely, optical fiber communication, wireless and interconnection networks, issues related to networking hardware and software and network mobility. The paper titled “Virtualization in Wireless Sensor Network: Challenges and Opportunities” argues in favor of bringing in different heterogeneous sensors under a common virtual framework so that the issues like flexibility, diversity, management and security can be handled practically. The authors Md. Motaharul Islam and Eui-Num Huh propose an architecture for sensor virtualization. They also present the current status and the challenges and opportunities for further research on the topic. The manuscript “Effect of Polarization Mode Dispersion on the BER Performance of Optical CDMA” deals with impact of polarization mode dispersion on the bit error rate performance of direct sequence optical code division multiple access. The authors, Md. Jahedul Islam and Md. Rafiqul Islam present an analytical approach toward determining the impact of different performance parameters. The authors show that the bit error rate performance improves significantly by the third order polarization mode dispersion than its first or second order counterparts. The authors Md. Shohrab Hossain, Mohammed Atiquzzaman and William Ivancic of the paper “Cost and Efficiency Analysis of NEMO Protocol Entities” present an analytical model for estimating the cost incurred by major mobility entities of a NEMO. The authors define a new metric for cost calculation in the process. Both the newly developed metric and the analytical model are likely to be useful to network engineers in estimating the resource requirement at the key entities while designing such a network. The article titled “A Highly Flexible LDPC Decoder using Hierarchical Quasi-Cyclic Matrix with Layered Permutation” deals with Low Density Parity Check decoders. The authors, Vikram Arkalgud Chandrasetty and Syed Mahfuzul Aziz propose a novel multi-level structured hierarchical matrix approach for generating codes of different lengths flexibly depending upon the requirement of the application. The manuscript “Analysis of Performance Limitations in Fiber Bragg Grating Based Optical Add-Drop Multiplexer due to Crosstalk” has been contributed by M. Mahiuddin and M. S. Islam. The paper proposes a new method of handling crosstalk with a fiber Bragg grating based optical add drop multiplexer (OADM). The authors show with an analytical model that different parameters improve using their proposed OADM. The paper “High Performance Hierarchical Torus Network Under Adverse Traffic Patterns” addresses issues related to hierarchical torus network (HTN) under adverse traffic patterns. The authors, M.M. Hafizur Rahman, Yukinori Sato, and Yasushi Inoguchi observe that dynamic communication performance of an HTN under adverse traffic conditions has not yet been addressed. The authors evaluate the performance of HTN for comparison with some other relevant networks. It is interesting to see that HTN outperforms these counterparts in terms of throughput and data transfer under adverse traffic. The manuscript titled “Dynamic Communication Performance Enhancement in Hierarchical Torus Network by Selection Algorithm” has been contributed by M.M. Hafizur Rahman, Yukinori Sato, and Yasushi Inoguchi. The authors introduce three simple adapting routing algorithms for efficient use of physical links and virtual channels in hierarchical torus network. The authors show that their approaches yield better performance for such networks. The final title “An Optimization Technique for Improved VoIP Performance over Wireless LAN” has been contributed by five authors, namely, Tamal Chakraborty, Atri Mukhopadhyay, Suman Bhunia, Iti Saha Misra and Salil K. Sanyal. The authors propose an optimization technique for configuring the parameters of the access points. In addition, they come up with an optimization mechanism in order to tune the threshold of active queue management system appropriately. Put together, the mechanisms improve the VoIP performance significantly under congestion. Finally, the Guest Editors would like to express their sincere gratitude to the 15 reviewers besides the guest editors themselves (Khalid M. Awan, Mukaddim Pathan, Ben Townsend, Morshed Chowdhury, Iftekhar Ahmad, Gour Karmakar, Shivali Goel, Hairulnizam Mahdin, Abdullah A Yusuf, Kashif Sattar, A.K.M. Azad, F. Rahman, Bahman Javadi, Abdelrahman Desoky, Lenin Mehedy) from several countries (Australia, Bangladesh, Japan, Pakistan, UK and USA) who have given immensely to this process. They have responded to the Guest Editors in the shortest possible time and dedicated their valuable time to ensure that the Special Issue contains high-quality papers with significant novelty and contributions.

Novel applications and research problems for sensor-clouds

Recent developments in sensor networks and cloud computing saw the emergence of a new platform called sensor-clouds. While the proposition of such a platform is to virtualise the management of physical sensor devices, we foresee novel applications being created based on a new class of social sensors. Social sensors are effectively a human-device combination that sends torrents of data as a result of social interactions. The data generated appear in different formats such as photographs, videos, or short texts, etc. Unlike other sensor devices, social sensors operate on the control of individuals via their mobile devices like smart phones, tablets or laptops. Further, they do not generate data at a constant rate or format like other sensors do. Instead, data from social sensors are spurious and varied, often in response to social events, or a news announcement of interests to the public. This collective presence of social data creates opportunities for novel applications never experienced before. This paper discusses three such applications utilising social sensors within a sensor-cloud environment. Consequently, the associated research problems are also presented.

T-OSN : a trust evaluation model in online social networks

Now days, the online social networks (OSN) have gained considerable popularity. More and more people use OSN to share their interests and make friends, also the OSN helps users overcome the geographical barriers. With the development of OSN, there is an important problem users have to face that is trust evaluation. Before user makes friends with a stranger, the user need to consider the following issues: Can a stranger be trusted? How much the stranger can be trusted? How to measure the trust of a stranger? In this paper, we take two factors, Degree and Contact Interval into consideration, which produce a new trust evaluation model (T-OSN). T-OSN is aimed to solve how to evaluate the trust value of an OSN user, also which is more efficient, more reliable and easy to implement. Base on our research, this model can be used in wide range, such as online social network (OSN) trust evaluation, mobile network message forwarding, ad hoc wireless networking, routing message on Internet and peer-to-peer file sharing network. The T-OSN model has following obvious advantages compare to other trust evaluate methods. First of all, it is not base on features of traditional social network, such as, distance and shortest path. We choose the special features of OSN to build up the model, that is including numbers of friends(Degree) and contact frequency(Contact Interval). These species features makes our model more suitable to evaluate OSN users trust value. Second, the formulations of our model are quite simple but effective. That means, to calculate the result by using our formulations will not cost too much resources. Last but not least, our model is easy to implement for an OSN website, because of the features that we used in our model, such as numbers of friends and contact frequency are easy to obtain. To sum up, our model is using a few resources to obtain a valuable trust value that can help OSN users to solve an important security problem, we believe that will be big step - or development of OSN.

Prediction of Drug Dissolution Profiles Using Artificial Neural Networks

This paper investigates the efficacy and reliability of Artificial Neural Networks (ANNs) as an intelligent decision support tool for pharmaceutical product formulation. Two case studies have been employed to evaluate capabilities of the Multilayer Perceptron network in predicting drug dissolution/release profiles. Performances of the network were evaluated using similarity factor (&fnof[sub 2]) — an index recommended by the United States Food and Drug Administration for profile comparison in pharmaceutical research. In addition, the bootstrap method was applied to assess the network prediction reliability by estimating confidence intervals associated with the results. The Multilayer Perceptron network also demonstrated a superior performance in comparison with multiple regression models. The results reveal that the ANN system has potentials to be a decision support tool for profile prediction in pharmaceutical experimentation, and the bootstrap method could be used as a means to assess reliability of the network prediction. [ABSTRACT FROM AUTHOR].

Modeling and defense against propagation of worms in networks

Worms are widely believed to be one of the most serious challenges in network security research. In order to prevent worms from propagating, we present a microcosmic model, which can benefit the security industry by allowing them to save significant money in the deployment of their security patching schemes.

Recovery mechanism on sensor networks

On the completion of project, we propose novel recovery mechanisms which recovers limited-resource wireless sensor networks quickly from an malicious attack. The research outcomes include re-clustering algorithms, reprogramming techniques and authentications protocols developed and tested on both hardware and simulation platforms. The work is also well compared with other researchers.

Integrating online social networks with e-commerce : a CBR approach

Integrating online social networks (OSN) with e-commerce is a part of Enterprise 2.0 and social media and is of significance for development of e-commerce and online social networking services. However, how to integrate online social networks including Facebook with e-commerce is still a big issue for companies. Case based reasoning (CBR) has a number of successful applications in e-commerce and web services. This article examines how to integrate OSN with e-commerce, how to integrate CBR with e-commerce and how to integrate CBR with OSN. This article also proposes a CBR architecture for integrating online social networks with e-commerce using CBR as an intelligent intermediary. One of the research findings indicates that the principle of CBR is a useful marketing strategy for integrating e-commerce and OSN. The approach proposed in this research will facilitate the development of e-commerce, Enterprise 3.0 and online social networking services.