ad hoc网络的可生存性问题及设计挑战

本文介绍了ad hoc网络可生存性面临的问题和挑战,特别强调了军事需求.其中从三个方面探讨了ad hoc网络的可生存性问题:可生存的网络连接、可生存的通信服务及可生存性技术,尤其是对可生存性技术进行了较全面的剖析.     

基于协作通信的TD-VAA-SCDMA系统

协作通信解决了普通单天线移动终端的空间分集问题,使单天线移动终端在多用户环境中可共享其他终端的天线,从而得到多天线分集增益,改善了移动通信系统的性能.本文从协作通信的概念和原理出发,提出了一种基于协作通信的虚拟多天线(VAA)TD-SCDMA系统,探讨了该系统中各层的实现和面临的挑战.     

A loop-based approach in clustering and routing in Mobile Ad hoc NETworks

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks （MANETs）, it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop composed of setup procedure, regular procedure and emergent route recovering. suggests smart route recovery strategy. Our approach is recovery procedure to achieve clustering, routing and     

ADLE:一种Ad hoc网络分布式领导者选取算法

Ad hoc网络的动态拓扑结构和节点自组织给分布式算法的实现带来了诸多困难.Ad hoc网络分布式领导者选举算法:ADL.该算法基于广播机制,采用逻辑时戳保证消息的时序性,避免了节点饿死.同时,它通过缩小算法执行范围降低了消息复杂度,而且不需要节点了解系统中所有节点的信息,因而能够适应Ad hoc网络的动态拓扑结构和节点频繁出入.分析与仿真结果表明该算法具有较低的消息复杂度、小响应延迟和公平性.     

AN ENHANCEMENT SCHEME OF TCP PROTOCOL IN MOBILE AD HOC NETWORKS： MME-TCP

Transmission Control Protocol （TCP） optimization in Mobile Ad hoc NETworks （MANETs） is a challenging issue because of some unique characteristics of MANETs. In this paper, a new end-to-end mechanism based on multiple metrics measurement is proposed to improve TCP performance in MANETs. Multi-metric Measurement based Enhancement of TCP （MME-TCP） designs the metrics and the identification algorithm according to the characteristics of MANETs and the experiment results. Furthermore, these metrics are measured at the sender node to reduce the overhead of control information over networks. Simulation results show that MME-TCP mechanism achieves a significant performance improvement over standard TCP in MANETs.     

How does time spent on WeChat bolster subjective well-being through social integration and social capital?

Although WeChat has recently spawned significant resolutions in technology-mediated social contact and interpersonal communication, the research regarding the social and psychological impacts of the newly emerging technology is relatively few. The primary purpose of the current empirical research is to unearth whether and how WeChat interaction could enhance overseas students’ sense of subjective well-being by concentrating on social integration, bridging relationships, and bonding relationships. Using web-based data of 228 Chinese subjects, the obtained results reveal that the time spent on WeChat significantly and directly impacts users’ subjective well-being. Additionally, the findings demonstrate that social integration, bridging relationships, bonding relationships are all significant predictors to subjective well-being. Furthermore, the perceptions of social integration and social capital could play the crucial mediating roles in the connection between WeChat use and the dependent variable of subjective well-being. Therefore, these outcomes may shed light on a more nuanced comprehending of the influence of the new social media interaction on sojourner’s social adaption and overall life quality in the digital age.     

σ-多项式的根

§ 1　IntroductionAll graphs considered are finite and simple.Undefined notation and terminology willconform to those in[1 ] .Let V(G) ,E(G) and Gdenote the vertex set,edge set and complement of a graph G,respectively. Let P(G,x) andσ(G,x) denote the chromatic polynomial andσ-polynomialof G,respectively.The log-concavity property of the chromatic polynomial andσ-polyno-mial of G has a close relation to their roots,which were well studied in[2 ,3] .Results onthe study of the roots of…     

Random waypoint model in n-dimensional space

The random waypoint model (RWP) is one of the most widely used mobility models in performance analysis of mobile wireless networks. In this paper we extend the previous work by deriving an analytical formula for the stationary distribution of a node moving according to a RWP model in n-dimensional space.     

Effects of brand anthropomorphism on consumer-brand relationships on social networking site fan pages: The mediating role of social presence

This study aimed to investigate the effects of brand anthropomorphism on consumer-brand relationships in a social media marketing context. We hypothesized that anthropomorphism on a brand’s Facebook fan page can strengthen the relationships between brands and consumers by yielding both social presence and a positive inference regarding the brand’s quality as a relationship partner. Our longitudinal experiment confirmed the effects of brand anthropomorphism on consumer-brand relationships on social media and the mediating role of social presence. The results suggest that when the anthropomorphized brand had relationships with consumers, a favorable attitude was shown toward the brand. Further, the participants perceived the anthropomorphized brand as a trustworthy relationship partner, giving more “Likes” for the posts from the anthropomorphized brand than those from the non-anthropomorphized brand. Further, the results confirmed that these favorable relationships were maintained even after the participants became aware of a brand transgression.     

An adjusted K‐medoids clustering algorithm for effective stability in vehicular ad hoc networks

Recently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prevents nodes with volatile and suspicious behavior to be elected as a new CH. This screening ensures that the new CH retains its property as long as possible and thus increases the network stability. Empirical results confirm that in addition to the convergence speed that characterizes our adjusted K‐medoids clustering algorithm (AKCA), the proposed model achieves more stability and robustness when compared with most recent approaches designed for the same objective.