Contention-based forwarding for mobile ad hoc networks

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically.

Due to mobility, the information that a node receives about its neighbors becomes outdated, leading either to a significant decrease in the packet delivery rate or to a steep increase in load on the wireless channel as node mobility increases. In this paper, we propose a mechanism to perform position-based unicast forwarding without the help of beacons. In our contention-based forwarding scheme (CBF) the next hop is selected through a distributed contention process based on the actual positions of all current neighbors. For the contention process, CBF makes use of biased timers. To avoid packet duplication, the first node that is selected suppresses the selection of further nodes. We propose three suppression strategies which vary with respect to forwarding efficiency and suppression characteristics. We analyze the behavior of CBF with all three suppression strategies and compare it to an existing greedy position-based routing approach by means of simulation with ns-2. Our results show that CBF significantly reduces the load on the wireless channel required to achieve a specific delivery rate compared to the load a beacon-based greedy forwarding strategy generates.     

Data forwarding incentive mechanism based on auction model in mobile social network

Abstract:A data forwarding incentive mechanism based on auction model in mobile social network was proposed.In this incentive mechanism,the first-price sealed auction mode was extended,the transaction mode of virtual currency payment was adopted,and the procedure of data forwarding between nodes was abstracted into the auction transaction model.Based on the node's resource state,the virtual currency and the data property,the evaluation function of data forwarding transaction was given,and then the node gives the corresponding price according to the evaluation function and game strategy.Through the game analysis,the Nash equilibrium solution of AMIM was found,and the lowest bidder,of which the bid price was lower than the evaluation of data forwarding request node would been selected as the service provider for this data forwarding.In this incentive mechanism,the rational mobile nodes were enforced to voluntarily participate in data forwarding cooperation to maximize their own interests.The simulation experiment shows that AMIM mechanism can effectively reduce the energy consumption and improve the success rate and efficiency of data forwarding in the whole network system.     

移动网络前向指针策略的鉴权管理研究

鉴权管理是移动通信移动管理中非常重要的技术,其策略的选择将直接影响网络中各网元的信令负荷。本文主要讨论移动通信系统前向指针位置管理策略中的鉴权管理。当用户在远离其HLR的不同VLR对应覆盖区域移动时,系统通过向其原VLR索取剩余鉴权数据或向其HLR申请新鉴权数据来实现用户的鉴权管理。通过鉴权开销及被呼处理时延等指标的分析,本文提出的鉴权管理算法较适合于CMR较小的MS鉴权管理;当MS的CMR增大时,本文提出的鉴权管理算法与二层管理策略如GSM或IS-41移动系统的开销及时延等指标逐渐接近。     

Contention‐based geographic forwarding in asynchronous duty‐cycled wireless sensor networks

In asynchronous duty‐cycled wireless sensor networks, it is desirable that the data forwarding scheme is adaptive to the dynamics caused by the uncertainty of sensor nodes’ working schedules. Contention‐based forwarding is designed to adapt to the dynamic environments. In this work, we are interested in the contention‐based geographic forwarding (CGF) for two asynchronous duty‐cycling (ADC) models, which we refer to as uninterruptible ADC (U‐ADC) and interruptible ADC (I‐ADC). We propose a new residual time‐aware routing metric for CGF in the I‐ADC model and present a residual time‐aware forwarding scheme using this metric. We evaluate the performance of CGF in both asynchronous duty‐cycling models. Simulation results show that CGF in the U‐ADC model provides a shorter delivery delay while suffering from a high sender effective duty cycle problem. CGF in the I‐ADC model incurs a very long data delivery delay, but it can achieve a good load balancing among nodes. It is also demonstrated that the proposed residual time‐aware forwarding scheme lowers the effects of the performance degradation caused by the pure asynchronous duty‐cycling operation. Copyright © 2011 John Wiley & Sons, Ltd.     

可信度动态感知的间断连接无线网络数据转发机制

提出了一种节点可信度动态感知的间断连接无线网络数据转发机制,节点根据运动过程中所获知的局部网络状态信息以分布式的方式估计其他节点恶意度及协作度,并根据历史信息预测节点的连通状态,进而获知各个节点的信任程度,以合理地选择中继节点,实现高效的数据转发。仿真结果表明,所提出的机制能够有效提高数据传输的可靠性,并大幅降低网络负载率,提高网络资源利用率。     

暂态社区感知的ICWN数据转发机制

为了有效解决间断连接无线网络中的数据转发问题,提出了一种暂态社区感知的数据转发机制,运用半马尔可夫链模型描述节点在多个地理位置间的转移过程,预测节点在未来相遇的时间概率分布,确定节点相遇位置和时间,为下一跳中继节点的选择提供了理论依据。实验数值表明,与传统算法相比,所提机制能有效提高节点相遇预测的准确性,在数据成功投递率和传输时延等性能上都有较大的提升。     

基于社会特征周期演化的机会移动网络路由转发策略

针对分布式k团社区检测引起的超大社区问题,提出了具有节点退出机制的?-window社区检测方法,相应提出了?-window中心性估计。通过实验发现?-window社区和?-window中心性具有周期演化特性,利用该特性,提出TTL(time to live)社区检测和TTL中心性估计,以更准确预测消息生存期上节点的相遇。随后,利用TTL社区和TTL中心性作为转发测度,设计了新的机会移动网络路由算法PerEvo。实验结果表明,与现有的基于社会特征的路由算法比较,PerEvo在保持基本不变的传输开销的同时,有效提高了机会移动网络消息投递的成功率。 关键词：机会移动网络;社区;中心性;周期演化;消息转发     

基于合同理论的D2D数据协作转发机制

针对蜂窝网络控制下的终端直通（D2D）通信中的数据转发问题,提出了一种基于合同理论的D2D数据协作转发机制。首先,充分考虑用户的自私特征,构建了一种以D2D发送用户为合同委托方、以空闲用户为代理方的委托—代理模型。然后,利用合同双方的效用函数以及合同约束条件构建含约束条件的优化问题,并且将合同双方的效用函数转化为合同双方满意度,最后构建为最小权重的稳定匹配,从而获得最优合同解。仿真结果表明,所提出的算法能够较好地激励空闲用户参与协作通信,进而提升用户满意度以及吞吐量。     

An energy‐efficient clustering approach for collaborative data forwarding in heterogeneous MANET

Mobile ad hoc network consists of a group of mobile nodes that can communicate with each other without any infrastructure. Clustering of the mobile nodes ensures efficient use of available bandwidth and high network throughput. Various clustering schemes are developed to improve the energy efficiency and lifetime of the network. However, there is an increase in the energy consumption with the increase in the number of clusters for forwarding data. This paper presents an energy‐efficient clustering approach for collaborative data forwarding in mobile ad hoc network. The cluster head (CH) is selected based on the processing capability of the nodes and link connection metrics. The CH receives the data from the server and forwards the data to the member nodes at a corresponding data rate of the nodes. Data offloading technique manages the data traffic in the network. The CH rejoining approach enables load balancing in the network. The proposed clustering approach achieves a significant reduction in the energy consumption and data traffic and improvement in the throughput rate through stable routing.     

编码节点动态管理的间断连接无线网络数据转发机制简

网络编码方法能够有效地提高间断连接无线网络的资源利用率,但编码节点的数量需要根据网络状态动态地调整。为有效提高网络资源利用率,提出一种带有编码节点动态管理的间断连接无线网络数据转发机制。节点根据当前网络状态,以分布式的方式确定最优化编码节点数量,进而,综合考虑社会属性及可用资源两方面因素,动态地选取编码节点,以较低的开销实现可靠数据转发。仿真结果表明所提出的机制充分利用了节点间的连接机会,提高了网络资源利用率。     

The extended connection‐dependent threshold model for call‐level performance analysis of multi‐rate loss systems under the bandwidth reservation policy

Firstly, we reviewed two extensions of the Erlang multi‐rate loss model, whereby we can assess the call‐level QoS of telecom networks supporting elastic traffic: (i) the extended Erlang multi‐rate loss model, where random arriving calls of certain bandwidth requirements at call setup can tolerate bandwidth compression while in service; and (ii) the connection‐dependent threshold model, where arriving calls may have several contingency bandwidth requirements, whereas in‐service calls cannot tolerate bandwidth compression. Secondly, we proposed a new model, the extended connection‐dependent threshold model. Calls may have alternative bandwidth requirements at call setup and can tolerate bandwidth compression while in service. We proposed a recurrent formula for the efficient calculation of link occupancy distribution and consequently call blocking probabilities, link utilization, and throughput per service class. Furthermore, in the proposed model, we incorporated the bandwidth reservation policy, whereby we can (i) equalize the call blocking probabilities of different service classes, (ii) guarantee specific QoS per service class, and (iii) implement different maximum bandwidth compression/expansion rate per service class so that the network supports both elastic and stream traffic. The accuracy of the new model is verified by simulation. Moreover, the proposed model performs better than the existing models. Finally, we generalize the proposed model by incorporating service classes with either random or quasi‐random arrivals. Copyright © 2011 John Wiley & Sons, Ltd.     

Non‐cooperative game‐based packet ferry forwarding for sparse mobile wireless networks

In sparse mobile wireless networks, normally, the mobile nodes are carried by people, and the moving activity of nodes always happens in a specific area, which corresponds to some specific community. Between the isolated communities, there is no stable communication link. Therefore, it is difficult to ensure the effective packet transmission among communities, which leads to the higher packet delivery delay and lower successful delivery ratio. Recently, an additional ferry node was introduced to forward packets between the isolated communities. However, most of the existing algorithms are working on how to control the trajectory of only one ferry work in the network. In this paper, we consider multiple ferries working in the network scenario and put our main focus on the optimal packet selection strategy, under the condition of mutual influence between the ferries and the buffer limitation. We introduce a non‐cooperative Bayesian game to achieve the optimal packet selection strategy. By maximizing the individual income of a ferry, we optimize the network performance on packet delivery delay and successful delivery ratio. Simulation results show that our proposed packet selection strategy improves the network performance on packet delivery delay and successful delivery ratio. Copyright © 2013 John Wiley & Sons, Ltd.     

Performance analysis of hop‐limited epidemic routing in DTN with limited forwarding times

Because of the uncertainty of transmission opportunity in delay tolerant networks (DTN), routing algorithms in DTN often need nodes to serve as relays for others to carry and forward messages. One classic policy is the Epidemic routing (ER) algorithm. To reduce the overhead, the hop‐limited ER protocol is proposed. This method can get better performance through controlling the message hop count. However, because of the energy constraint or other factors, each node may forward only limited times, that is, both the message hop count and the forwarding times may be limited. This paper proposes a unifying framework to evaluate the performance of ER with the aforementioned constraints. Simulations based on both synthetic and real motion traces show the accuracy of the framework. In addition, we explore the impact of many parameters (e.g., message hop count) through extensive numerical results. For example, numerical results show that both the message hop count and the forwarding times can have certain impact on the routing performance, but their impact is related with many other factors (e.g., the number of nodes). Copyright © 2014 John Wiley & Sons, Ltd.     

Robust congestion control in cognitive radio network using dynamic event‐triggered sliding mode

The ever‐increasing service demand from wireless users under restricted bandwidth necessitates the development of suitable congestion control scheme for throughput maximization. A robust congestion controller design has been addressed in this work to sustain necessary Quality of Service in Cognitive Radio Network. The goal is to reduce packet loss while ensuring optimum utilization of available resources. Sliding mode controller proclaimed for its disturbance rejection capabilities and robustness has been used to design the proposed controller. Using the benefits of sliding mode control, dynamic event‐triggering strategies have been combined for better utilization in resource‐constrained environments. Control execution requires minimal updates while guaranteeing the desired closed‐loop system behavior. The controller efficacy has been validated in simulations.     

A call‐state‐based service triggering algorithm for IMS network

To determine the potential signaling traffic reductions, the session establishment procedures were investigated. The investigation showed that the serving call session control function (S‐CSCF) is the major bottleneck in IP multimedia subsystem (IMS) network and the existing third‐generation partnership project (3GPP) service triggering algorithm (3GPP STA) based on initial filter criteria (iFC) increases largely the end‐to‐end session setup delay (SSD). To reduce the SSD and improve the system performance, a call‐state‐based application triggering architecture (CATA) was proposed. In CATA, the call‐state‐based filter criteria and the call‐state‐based service triggering algorithm (CSTA) were proposed, and then the modeling of 3GPP STA and CSTA was presented. Theoretical analysis and simulation results showed that the CSTA avoids the additional signaling traffic load of the S‐CSCF and application server effectively, which exists in 3GPP STA, reduces the SSD considerably, increases the throughput of the S‐CSCF and improves the quality of service of IMS network. Copyright © 2008 John Wiley & Sons, Ltd.     

ASR: anonymous and secure reporting of traffic forwarding activity in mobile ad hoc networks

Nodes forward data on behalf of each other in mobile ad hoc networks. In a civilian application, nodes are assumed to be selfish and rational, i.e., they pursue their own self-interest. Hence, the ability to accurately measure traffic forwarding is critical to ensure proper network operation. These measurements are also often used to credit nodes based on their level of participation, or to detect loss. Past solutions employ neighbor monitoring and reporting on traffic forwarding of nodes. These methods are not applicable in civilian networks in which neighbor nodes lack the desire or ability to perform the monitoring function. Such environments occur frequently in which neighbor hosts are resource constrained, or in networks where directional antennas are used and reliable eavesdropping is difficult or impossible. In this article, we propose a protocol that uses nodes on the data path to securely produce packet-forwarding reports. Reporting nodes are chosen randomly and secretly so that malicious nodes cannot modify their behavior based upon the monitoring point. The integrity and authenticity of reports are preserved through the use of secure link layer acknowledgments and monitoring reports. The robustness of the reporting mechanism is strengthened by forwarding the report to multiple destinations (source and destination). We explore the security, cost, and accuracy of our protocol.

Game theory based forwarding control method for social network

With the rapid development of mobile communication and internet technology,the social network has become one of the mainstream social means used in people’s daily social life.To maintain and strengthen relationships with friends,users may share personal behavior and feelings through social networks.Forwarding these contents may result in privacy leakage.To help publishers make proper data forwarding decision,the benefits of both sides of the forwarding operation were analyzed,and a game theory based forwarding control method for social network was proposed which could effectively prevent dishonest data forwarding operation.By analyzing the benefits of both sides of forwarding operation and considering historical information,the probability of dishonest data forwarding operation was calculated and it was compared with the threshold set by publisher to make the forwarding decision.The procedure and framework of the game theory based forwarding control method was introduced.The benefits of both sides were defined and analyzed.The game play scenario was presented.Some results of experiments are shown to support that the method is effective and it can protect the security of content in social network.     

Hopfield neural‐network‐based dynamic resource allocation scheme for non‐real‐time traffic in wireless networks

Dynamic resource allocation (DRA) plays a fundamental role in current and future wireless networks, including 3G systems. In this paper, a scheduling DRA scheme for non‐real‐time (NRT) packet services in wireless system is proposed based on the use of Hopfield neural networks (HNN). The scheme exploits the fast response time of HNN for solving NP optimization problems and has been particularized for the downlink transmission in a UMTS system, although it could be easily extended to any other radio access technology. The new DRA scheme follows a delay‐centric approach, since it maximizes the overall system resource utilization while minimizing the packet delay. Simulation results confirm that the proposed HNN‐based DRA scheme is effective in supporting different types of NRT services, while achieving efficient utilization of radio resources. Copyright © 2008 John Wiley & Sons, Ltd.     

Power allocation in the context of dimensioning the air‐interface of third generation W‐CDMA‐based cellular systems

The adoption of W‐CDMA as an essential component of the air‐interface of third‐generation cellular systems brings to the foreground the need for new planning methodologies and software tools. In this perspective, this paper addresses planning problems that are important to the dimensioning of W‐CDMA‐based cellular networks. The problems aim at finding the optimal feasible allocation of transmission power to the sets of uplink and downlink connections that should be supported by the system, so as to cope with a corresponding traffic load scenario. The problems are concisely defined, mathematically formulated and solved by means of two computationally efficient, novel algorithms. The solutions of the problems may be seen as operating points at which the system performance should be driven. Finally, numerical results are presented and concluding remarks are drawn. Copyright © 2002 John Wiley & Sons, Ltd.     

基于信息中心5G车联网中社会感知的流媒体缓存与转发策略

5G 通信技术的到来为车载自组网（VANET）提供高质量的视频流服务奠定了基础。然而,现有的VANET 仍然采用以主机通信而非内容分发的 IP 网络来分发视频数据,造成了网络功能与设计目标之间的不匹配,为提供高质量的视频服务带来了巨大挑战。基于上述问题,提出了一种以信息为中心的社会感知流媒体缓存和转发策略（SACF）,其时间复杂度为O(m²)。首先,通过分析用户节点的行为构建社会感知的虚拟社区;然后,提出了一种视频快速转发机制来支持用户就近获取视频内容;最后,提出了一种基于社区的缓存策略来优化视频的缓存分布。仿真实验结果表明,与最新的解决方案相比,该算法的缓存命中率提高了18%,查找时延降低了33%,平均网络开销减少了14.6%。