Uniquely Decomposable Constellation Group-Based Sparse Vector Coding for Short Packet Communications

Sparse vector coding(SVC)is emerging as a potential technology for short packet communications.To further improve the block error rate(BLER)performance,a uniquely decomposable constellation group-based SVC(UDCG-SVC)is proposed in this article.Additionally,in order to achieve an optimal BLER performance of UDCG-SVC,a problem to optimize the coding gain of UDCG-based superimposed constellation is formulated.Given the energy of rotation constellations in UDCG,this problem is solved by converting it into finding the maximized minimum Euclidean distance of the superimposed constellation.Simulation results demonstrate the validness of our derivation.We also find that the proposed UDCGSVC has better BLER performance compared to other SVC schemes,especially under the high order modulation scenarios.

Decision Tree Based Key Management for Secure Group Communication

Group communication is widely used by most of the emerging network applications like telecommunication,video conferencing,simulation applications,distributed and other interactive systems.Secured group communication plays a vital role in case of providing the integrity,authenticity,confidentiality,and availability of the message delivered among the group members with respect to communicate securely between the inter group or else within the group.In secure group communications,the time cost associated with the key updating in the proceedings of the member join and departure is an important aspect of the quality of service,particularly in the large groups with highly active membership.Hence,the paper is aimed to achieve better cost and time efficiency through an improved DC multicast routing protocol which is used to expose the path between the nodes participating in the group communication.During this process,each node constructs an adaptive Ptolemy decision tree for the purpose of generating the contributory key.Each of the node is comprised of three keys which will be exchanged between the nodes for considering the group key for the purpose of secure and cost-efficient group communication.The rekeying process is performed when a member leaves or adds into the group.The performance metrics of novel approach is measured depending on the important factors such as computational and communicational cost,rekeying process and formation of the group.It is concluded from the study that the technique has reduced the computational and communicational cost of the secure group communication when compared to the other existing methods.

A Secure Session Key Distribution Scheme for Group Communications

In a secure group communication system, messages must be encrypted before being transmitted to group members to prevent unauthorized access. In many secure group communication schemes, whenever a member leaves or joins the group, group center (GC) immediately changes the common encryption key and sends the new key to all valid members for forward and backward secrecy. If valid members are not on-line, they will miss the re-keying messages and will not be able to decrypt any ciphertext. Therefore, group members must be able to store the state of the system. In some applications, like global positioning systems (GPS) or pay-per-view systems, it is not reasonable to ask group members to stay on-line all the time and save the changes to the system. A hierarchical binary tree-based key management scheme are proposed for a secure group communication. This scheme reduces the key storage requirement of GC to a constant size and the group members are not required to be on-line constantly (stateless).

SECURE GROUP COMMUNICATIONS FOR LARGE DYNAMIC MULTICAST GROUP

As the major problem in multicast security, the group key management has been the focus of research But few results are satisfactory. In this paper, the problems of group key management and access control for large dynamic multicast group have been researched and a solution based on SubGroup Secure Controllers (SGSCs) is presented, which solves many problems in IOLUS system and WGL scheme.

Overlay Share Mesh for Interactive Group Communication with High Dynamic

An overlay share mesh infrastructure is presented for high dynamic group communication systems, such as distributed interactive simulation (DIS) and distributed virtual environments (DVE). Overlay share mesh infrastructure can own better adapting ability for high dynamic group than tradition multi-tree multicast infrastructure by sharing links among different groups. The mechanism of overlay share mesh based on area of interest (AOI) was discussed in detail in this paper. A large number of simulation experiments were done and the performance of mesh infrastructure was studied. Experiments results proved that overlay mesh infrastructure owns better adaptability than traditional multi-tree infrastructure for high dynamic group communication systems.

Integrating IPsec within OpenFlow Architecture for Secure Group Communication

Network security protocols such as IPsec have been used for many years to ensure robust end-to-end communication and are important in the context of SDN. Despite the widespread installation of IPsec to date, per-packet protection offered by the protocol is not very compatible with OpenFlow and tlow-like behavior. OpenFlow architecture cannot aggregate IPsee-ESP flows in transport mode or tunnel mode because layer-3 information is encrypted and therefore unreadable. In this paper, we propose using the Security Parameter Index （SPI） of IPsec within the OpenFlow architecture to identify and direct IPsec flows. This enables IPsec to conform to the packet-based behavior of OpenFlow architecture. In addition, by distinguishing between IPsec flows, the architecture is particularly suited to secure group communication.

A Secure Key Management Scheme for Heterogeneous Secure Vehicular Communication Systems

Intelligent transportation system （ITS） is proposed as the most effective way to improve road safety and traffic efficiency. However, the future of ITS for large scale transportation infrastructures deployment highly depends on the security level of vehicular communication systems （VCS）. Security applications in VCS are fulfilled through secured group broadcast. Therefore, secure key management schemes are considered as a critical research topic for network security. In this paper, we propose a framework for providing secure key management within heterogeneous network. The seeurity managers （SMs） play a key role in the framework by retrieving the vehicle departnre infi^rmation, encapsulating block to transport keys and then executing rekeying to vehicles within the same security domain. The first part of this framework is a novel Group Key Management （GKM） scheme basing on leaving probability （LP） of vehicles to depart current VCS region. Vehicle＇s LP factor is introduced into GKM scheme to achieve a more effieient rekeying scheme and less rekeying costs. The second component of the framework using the blockchain concept to simplify the distributed key management in heterogeneous VCS domains. Extensive simulations and analysis are provided to show the effectiveness and effieiency of the proposed framework： Our GKM results demonstrate that probability-based BR reduees rekeying eost compared to the benchmark scheme, while the blockchain deereases the time eost of key transmission over heterogeneous net-works.

Group Activities in Task-based Communicative Classroom

In a task-based communicative classroom, group activities are effective ways to devdop students' 4 basic language skills. However, not all group activities can reach the expected results. English teachers should pay attention to some aspects in organizing a classroom group activity.

On improving students＇ communicative competence by group interaction

In foreign language teaching, the communicative approach has been a dominant method for decades. However, some misconceptions of the communicative approach affect the results of group interaction teaching. This article tries to explore some existing problems as well as some relevant solution in the application of group activities in colleges with the aid of observation, questionnaire and interview.

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure,designers have addressed scal-ing concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain.In tactical Mobile Ad-hoc Network(MANET),hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out,self-mending and self-administration.Clustering in the routing process is one of the key aspects to increase MANET performance by coordinat-ing the pathways using multiple criteria and analytics.We present a Group Adaptive Hybrid Routing Algorithm(GAHRA)for gathering portability,which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations.Based on this aspect,the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach,with the objectives of enhancing the out-put of MANET routing computation in each hub.Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.

A Discrepancy between An Advocacy of Group Work and the Reality of Its Poor Implementation ELT Classrooms of Junior High Schools in China's Mainland

The paper investigates how group work was implemented in English teaching classrooms in a junior high school of China's Mainland as a case study. The research data was collected by classroom observations, a survey of the students and interviews with the classroom teachers. The research finds a mismatch between an advocacy of group work and the reality of its poor implementation. It has implications on English curriculum innovation and the advocacy of group work in ELT classrooms in China's Mainland.

A new group key management scheme based on keys tree, XOR operation and one-way function

By introducing XOR operation and one-way function chains to group key management schemes based on the keys tree, a new group key management scheme based on the keys tree, XOR operation and one-way function chains is proposed. Initialization, member adding and member evicting operations are introduced. The new scheme is compared with three other group key management schemes which are based on the keys tree： SKDC, LKH, and OFF. As far as transmission, computation and storage costs are concerned, the performance of the new group key management scheme is the best. The security problem of the new scheme is analyzed. This new scheme provides backward and forward security, i.e.. newly admitted group members cannot read previous multicast messages and evicted members cannot read future multicast messages, even with collusion by many arbitrarily evicted members.

Towards Interaction,Communication and Integration of Ethnic Groups with Commonality:A Comparison of Inner Mongolia,Guangxi and Ningxia Autonomous Region

One crucial measure of strengthening and advancing the Party's work on ethnic affairs in the new era is to promote interaction,communication and integration of various ethnic groups,so as to enhance commonality.Entering the new era,Inner Mongolia,Guangxi and Ningxia have achieved remarkable results in encouraging interaction,communication and integration of various ethnic groups.By comparatively analyzing successes of the three autonomous regions through the perspective of promoting commonality,this article summarizes the following strategic revelations:1)we should comprehensively implement the Party's ethnic policies and ensure theactual implementation of mutual interaction,mutual communication and mutual integration of ethnic groups;2)we should proactively promote the substantial progress of the economy,so as to provide solid material foundation for mutual interaction,mutual communication and mutual integration of ethnic groups;3)we should facilitate activities that promote ethnic unity and progress,so that the promotion of interaction,communication and mutual integration of ethnic groups can be seen,be felt and gain actual outcomes;4)we should take measures that suit to local conditions and explore all-round embedding mechanisms in order to foster the ethos for mutual interaction,mutual communication and mutual integration of ethnic groups;5)we should make every effort to forge a strong sense of community for the Chinese nation and orient precisely to the cause of encouraging mutual interaction,mutual communication and mutual integration of ethnic groups.

Applying Communicative Teaching Method in English-teaching Classroom

Communicative language teaching is generally accepted in the field of second language teaching. In this paper, the author introduces a model of communicative language teaching. The authors also mention some practical requirements and methods in the application of this model, such as authentic materials and group work.

HUFFMAN-BASED GROUP KEY ESTABLISHMENT SCHEME WITH LOCATION-AWARE

Time efficiency of key establishment and update is one of the major problems contributory key managements strive to address.To achieve better time efficiency in key establishment,we propose a Location-based Huffman(L-Huffman) scheme.First,users are separated into several small groups to minimize communication cost when they are distributed over large networks.Second,both user's computation difference and message transmission delay are taken into consideration when Huffman coding is employed to forming the optimal key tree.Third,the combined weights in Huffman tree are located in a higher place of the key tree to reduce the variance of the average key generation time and minimize the longest key generation time.Simulations demonstrate that L-Huffman has much better performance in wide area networks and is a little better in local area network than Huffman scheme.

Reliable Content Distribution in P2P Networks Based on Peer Groups

Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which peers enter and leave the system, i.e. the churn, is often high. A user that is obtaining content from a selected peer is frequently informed that particular peer is not available anymore, and is asked to select another peer, or will have another peer assigned, often without enough checks to confirm that the content provided by the new peer presents the same quality of the previous peer. In this work we present a strategy based on group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. This group of peers, called PCG (Peer Content Group) provides reliable content access in sense that even as members of the group crash or leave the system, users continue to receive the content if at least one group member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer is serving request crashes, another group member is elected to continue providing the service. The PCG and a P2P file sharing applications were implemented in the JXTA platform. Evaluation results are presented showing the latency of group operations and system components.

Communicating About Translation： Task-based Speaking

This study views pedagogical translation as a means of developing language skills, especially oral communication. Contrary to the claim that translation focuses only on reading and writing, this study presents anecdotal evidence showing that a learner-centered approach to translation can help foreign language students improve their speaking skill through group work, problem-solving, and cooperative learning. To this end, the paper presents practical examples of lexical, structural, textual, and cultural issues that students discussed in their process-oriented Arabic-English-Arabic pedagogical translation courses at the university level. The students were divided into groups of three or four to work together at all stages of the translation process. They spent most of the class time comprehending the source text, translating it, and discussing each other＇s target versions. In the remaining class time, the whole class discussed a target text translated by any one of the groups. The students were instructed to use English in their group and whole-class deliberations. They were also instructed to use the appropriate language functions, structures, and expressions to achieve objectivity in their arguments. The study calls for further empirical research to verify the usefulness of the proposed learner-centered translation-based technique of teaching speaking

Algorithm for Delay-Constrained Minimal Cost Group Multicasting

Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.

Energy-Efficient MTC Data Offloading in Wireless Networks Based on K-Means Grouping Technique

Machine-type communication (MTC) devices provide a broad range of data collection especially on the massive data generated environments such as urban, industrials and event-enabled areas. In dense deployments, the data collected at the closest locations between the MTC devices are spatially correlated. In this paper, we propose a k-means grouping technique to combine all MTC devices based on spatially correlated. The MTC devices collect the data on the event-based area and then transmit to the centralized aggregator for processing and computing. With the limitation of computational resources at the centralized aggregator, some grouped MTC devices data offloaded to the nearby base station collocated with the mobile edge-computing server. As a sensing capability adopted on MTC devices, we use a power exponential function model to compute a correlation coefficient existing between the MTC devices. Based on this framework, we compare the energy consumption when all data processed locally at centralized aggregator or offloaded at mobile edge computing server with optimal solution obtained by the brute force method. Then, the simulation results revealed that the proposed k-means grouping technique reduce the energy consumption at centralized aggregator while satisfying the required completion time.

The Assessment of Interpersonal Attraction and Group Identification in Virtual Group Network

This study investigates the measurement of social identification, interpersonal attraction, and cohesiveness in virtual groups. Different theoretical claims about relationships in computer-mediated groups rely on measurement strategies that are shown to reflect dramatically inconsistent semantic and administration features. A review of conceptual approaches and definitions for these constructs is presented. Data were collected from groups working asynchronously via the Internet under different geographic distributions, whose members completed a variety of measures related to these constructs. Analyses generated three likely dimensions of attraction. The research highlights the need for greater specificity in reports of the actual measures used in group research, and additional conceptual concerns regarding the contested relationships among these constructs.