ECBRP: An Efficient Cluster-Based Routing Protocol for Real-Time Multimedia Streaming in MANETs

The dynamic characteristics of wireless networks and stringent QoS requirements of multimedia applications identify significant challenges for providing QoS guarantees for real-time multimedia streaming in such wireless environment. QoS routing protocols can decisively contribute to the QoS provision of network systems. This paper proposes an efficient cluster-based routing protocol (ECBRP) for real-time multimedia streaming in mobile ad hoc networks. First, to improve the stability of clusterheads, we introduce a new algorithm of cluster formation, in consideration of the node mobility and connectivity. Second, a link-broken detection mechanism is designed, which is able to distinguish whether packet loss is due to mobility or congestion, and to make proper reaction. This mechanism contributes to reduce route overhead, and to increase the decodable ratio of video frame at the application layer as well. Third, the routing protocol is enhanced via an adaptive packet salvage strategy, in order to alleviate the congestion in consideration of the characteristics of multimedia traffic. Our simulation experiment results demonstrate that the ECBRP leads to more stable cluster formation than the CBRP, and 80% decreases in the frequency of clusterhead changes against CBRP. As a result, the quality of real-time multimedia streaming is improved significantly, in terms of decodable frame ratio, delay and delay jitter, etc.     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

Challenges for Semiconductor Test Engineering: A Review Paper

Today??s economical cycles challenge the test program generation process for semiconductors with regard to productivity, time-to-market, increasing quality requirements and manufacturing robustness, while, at the same time, the complexity of the system-on-a-chip mixed-signal integrated circuits to be tested increases significantly. Furthermore, commercial challenges in combination with competitive advantage become an important factor, not only within semiconductor manufacturing, but also within test program development. This paper provides a review of these challenges, and how they might be addressed. We first give a short introduction and background on semiconductor testing and test development with the focus on mixed-signal and systems-on-chip. This is followed by current roadmaps and considerations for test program software development. Based on the highlighted strength and weaknesses of the reviewed approaches, the authors conclude with some recommendations to address these challenges by adopting software engineering methods for the test program development process.     

On Routing in Multichannel Wireless Mesh Networks: Challenges and Solutions

Wireless mesh networks have emerged as a promising solution to providing cost-effective last-mile connectivity. Employing multiple channels is shown to be an effective approach to overcoming the problem of capacity degradation in multihop wireless networks. However, existing routing schemes that are designed for single-channel multihop wireless networks may lead to inefficient routing paths in multichannel WMNs. To fully exploit the capacity gain due to multiple channels, one must consider the availability of multiple channels and distribute traffic load among channels as well as among nodes in routing algorithms. In this article we focus on the routing problem in multichannel WMNs. We highlight the challenges in designing routing algorithms for multichannel WMNs and examine existing routing metrics that are designed for multichannel WMNs, along with a simulation-based performance study. We also address some open research issues related to routing in multichannel WMNs.     

一种新的自组网区域路由多径算法

能量消耗是移动自组网（MANET）路由协议研究中的一介热点所在。区域路由协议作为混合式寻路机制,为移动自组网提供了一种灵活的路由选择方式。在其路由发现的过程中,存在着多径问题,合理地利用这些路径进行路由转发,可以降低节点间功耗的偏差,使得整介网络能量消耗比较均匀。仿真表明,区域内路由部分中,该算法可较大地延长网络生存周期,而区域间路由部分所受影响则较小。     

路由协议RIP慢收敛问题及其对策

文章介绍了基于V-D算法的RIP动态路由协议,针对RIP的实现算法所导致的慢收敛问题进行了分析并提出了解决慢收敛问题的对策.     

BGP路由协议实际应用中的问题及解决方案

边界网关协议(BGP)在因特网上运行时存在路由不稳定(routing instability)、慢收敛(slow convergence)以及可扩展性(scalability)差等问题,随着因特网规模的不断扩大,这三个问题变得日趋严重.本文首先对这三个问题的成因做了深入的分析,然后把目前对这些问题的解决方案分为直接和间接两大类,分别对这两大类中有代表性的解决方案进行介绍并对其有效性做出了评估.     

Efficient Ad Hoc On Demand Distance Vector Routing Protocol Based on Route Stability in MANETs

International Journal of Wireless Information Networks - Nodes in Mobile Ad hoc Networks (MANETs) communicate wirelessly without any dedicated infrastructure and administrative control. In MANETs,...     

Cross-Layer Design Based N-ary Huffman Coding for Performance Analysis of DSDV Routing Protocol in MANETs

Wireless Personal Communications - The implementation of the optimal Huffman coding technique for achieving proficient data compression, lower information redundancy and minimal utilization of the...     

移动自组网中基于预测的路由协议研究

由于移动自组网中的节点可以任意的运动，导致网络中传输路径的频繁断裂，大量的重路由操作降低了网络性能，并占用了有限的网络资源。而基于预测的路由协议能够有效地减少网络拓扑结构的变化对于路由操作的影响。文章主要讨论了目前已经提出的几种节点运动预测方案．以及基于预测的路由协议，并提出了进一步的研究方向。     

An Efficient and Scalable Routing for MANETs

Recently, Distributed-Hash-Table (DHT)-based routing protocols have been proposed for large scale mobile ad hoc networks (MANETs). The motive behind using DHT is to avoid/reduce network wide flooding in MANETs in route discovery phase leading to achieve more scalable network. The challenge of deploying DHT at network layer for routing purpose in MANETs is to achieve more matching between logical and physical networks. The paper describes that existing DHT-based routing protocols for MANETs lack this feature. The paper presents a new DHT based scheme [called an efficient and scalable routing for MANETs (ESR)] which reduces the ill-matching between logical and physical networks. This is achieved be distributing the logical identifier (LID) space of DHT structure among the nodes such that the physical neighbors have consecutive LID space portions, i.e. all physical neighbors of a node are also the logical neighbors of the node. Therefore the logical ID space portion of a node may be non-contiguous. Based on this logical structure, a node builds up binary-search-tree (BST) using both logical ID space portion of itself and its neighbors. This BST at the node is traversed to find the next hop for a query/message. Through simulation, the paper shows the proposed approach (ESR) performs better than the existing one in term of routing overhead, average end-to-end delay, path-stretch values and false-negative ratio.     

A Game Theoretical Framework for Dynamic Pricing-Based Routing in Self-Organized MANETs

In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by awarding some payment for cooperative behaviors. In this paper, we consider efficient routing in self-organized MANETs and model it as multi-stage dynamic pricing games. A game theoretical framework for dynamic pricing-based routing in MANETs is proposed to maximize the sender/receiver?s payoff by considering the dynamic nature of MANETs. Meanwhile, the forwarding incentives of the relay nodes can also be maintained by optimally pricing their packet-forwarding services based on the auction rules and introducing the Cartel Maintenance enforcing mechanism. The simulation results illustrate that the proposed dynamic pricing-based routing approach has significant performance gains over the existing static pricing approaches.     

A Failsafe Distributed Routing Protocol

An algorithm for constructing and adaptively maintaining routing tables in communication networks is presented. The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe. The latter means that after arbitrary failures and additions, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. For each destination, the routes are independently updated by an update cycle triggered by the destination.     

A Review on the Security of the Internet of Things: Challenges and Solutions

The Internet of Things (IoT) has emerged as a modern wave of Internet technologies that promises great transformation of life in areas such as smart health, smart cities, smart homes, intelligent transport, amongst others. However, security often serves as a critical reason for the widespread adoption of any innovation. While the IoT has increased business productivity and enriched diverse areas of life over the years, the world is yet to see a methodical revolution of its humongous application and transformation given its ubiquity and highly interconnected global network structure. The main culprit for such lapses is principally attributed to security and privacy issues which have been widely discussed in research articles and reviews but remain largely unaddressed in the literature. Hence, this paper provides a state-of-the-art review of IoT security and its challenges. It overviews technical and legal solutions that are useful to private, organizational, and governmental enterprises. The study encompasses the review and security analysis of IoT’s evolution and revolution, IoT security assessments, requirements, current research challenges in security and much more. Consequently, it offers potential solutions to address the security challenges discussed and further present open research issues, research gaps, opportunities, future development, and recommendations. This overview is intended to serve as a knowledgebase that will proffer novel foresight to guide users and administrators in positioning themselves and their organizations in a manner that is consistent with their overall objectives, mission, and vision for remarkable outcomes. Likewise, interested scholars and researchers can explore topics and directions from the study in providing better solutions to the numerous problems in IoT security.

     

无线Mesh网络路由协议——多射频质量源路由（MR-LQSR）协议

无线Mesh网络使用传统的基于最短路径的移动Ad Hoc网络路由协议并不能获得良好的性能,为此提出了一种新的无线Mesh网路由协议——MR—LQSR算法及新的路由判据——WCETT．能在吞吐量与延时之间获得一种平衡。     

MTAODV:一种新的高速公路场景下VANET路由协议

在高速公路场景中,针对车辆间通信特性,在AODV的基础上提出了一种基于应用消息类型的改进路由协议(MTAODV).其核心思想是在路由建立过程中充分考虑VANET中应用消息的类型,从而减小路由请求洪泛范围,降低网络开销.仿真实验结果表明,与AODV协议相比,MTAODV协议能够有效地提高分组递交率,降低了路由开销,改善了分组时延和抖动.     

动态QoS多播路由协议

本文主要研讨了具有QoS约束的动态多播路由问题.文中描述了一种适用于QoS多播路由的网络模型,提出了一种动态QoS多播路由协议(DQMRP),该协议能操作在单播路由协议的顶层,它只要求网络链路(或节点)的局部状态信息,不需要维护全局状态信息.DQMRP可有效地减少构造一棵多播树的开销,多播组成员可动态地加入／退出多播会晤.该协议可搜索多条可行树枝,并能选择一条最优(或近优)树枝将新成员连接到多播树.文中给出了DQMRP的正确性证明和复杂性分析,并通过仿真实验验证了该协议的可用性和有效性.     

一种蜂窝辅助的AODV路由协议

首先提出了一种新的融合AdHoe和蜂窝网络体系结构。接着在这种融合网络结构下,对传统AODV路由协议进行了改进,设计了一种蜂窝辅助的AODV路由协议（CA-AODV）。CA-AODV路由协议利用蜂窝系统中代理节点所保存的移动adhoe节点位置信息,来维护、更新节点中的路由,这种主动维护路由信息的方法从而可以提高传统AODV协议的性能。最后文中通过NS-2仿真表明：在数据发送率较高的情况下,CA-AODV路由协议能显著提高传统AODV协议的系统参数性能。