Error counter-based negative acknowledgement mode in CCSDS file delivery protocol

Deep space communication has its own features such as long propagation delays,heavy noise,asymmetric link rates,and intermittent connectivity in space,therefore TCP/IP protocol cannot perform as well as it does in terrestrial communications.Accordingly,the Consultative Committee for Space Data Systems (CCSDS) developed CCSDS File Delivery Protocol (CFDP),which sets standards of efficient file delivery service capable of transferring files to and from mass memory located in the space segment.In CFDP,four optional acknowledge modes are supported to make the communication more reliable.In this paper,we gave a general introduction of typical communication process in CFDP and analysis of its four Negative Acknowledgement (NAK) modes on the respect of file delivery delay and times of retransmission.We found out that despite the shortest file delivery delay,immediate NAK mode suffers from the problem that frequent retransmission may probably lead to network congestion.Thus,we proposed a new mode,the error counter-based NAK mode.By simulation of the case focused on the link between a deep space probe on Mars and a terrestrial station on Earth,we concluded that error counter-based NAK mode has successfully reduced the retransmission times at negligible cost of certain amount of file delivery delay.     

空间信息传输网络层协议分析

网络层处于空间信息传输协议体系的关键层,其协议选择关系着能否实现未来航天任务提出的动态数据传输、灵活路由选择、与地面网络的互操作性等技术要求。对CCSDS空间分包协议、SCPS-NP协议和IP协议等可用于空间通信的网络层协议进行了总结分析,并从功能、地址空间、协议开销和技术成熟度及产品支持等方面进行了比较。可以看出,IP协议是未来空间任务的合理选择。对于没有空间链路路由选择的任务,可先使用CCSDS空间分包协议解决动态数据传输问题。     

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (caching and multiple path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.     

A media access and feedback protocol for reliable multicast over wireless channel

A link level reliable multicast requires a channel access protocol to resolve the collision of feedback messages sent by multicast data receivers. Several deterministic media access control protocols have been proposed to attain high reliability, but with large delay. Besides, there are also protocols which can only give probabilistic guarantee about reliability, but have the least delay. In this paper, we propose a virtual token-based channel access and feedback protocol (VTCAF) for link level reliable multicasting. The VTCAF protocol introduces a virtual (implicit) token passing mechanism based on carrier sensing to avoid the collision between feedback messages. The delay performance is improved in VTCAF protocol by reducing the number of feedback messages. Besides, the VTCAF protocol is parametric in nature and can easily trade off reliability with the delay as per the requirement of the underlying application. Such a cross layer design approach would be useful for a variety of multicast applications which require reliable communication with different levels of reliability and delay performance. We have analyzed our protocol to evaluate various performance parameters at different packet loss rate and compared its performance with those of others. Our protocol has also been simulated using Castalia network simulator to evaluate the same performance parameters. Simulation and analytical results together show that the VTCAF protocol is able to considerably reduce average access delay while ensuring very high reliability at the same time.     

Comparison of MANET Routing Protocols Using a Scaled Indoor Wireless Grid

Predicting the performance of ad-hoc networking protocols has typically been performed by making use of software based simulation tools. Experimental study and validation of such predictions is vital to obtaining more realistic results, but may not be possible under the constrained environment of network simulators. This paper presents experimental comparisons of routing protocols using a 7?×?7 grid of closely spaced WiFi nodes. It firstly demonstrates the usefulness of the grid in its ability to emulate a real world multi-hop ad-hoc network. It specifically compares hop count, routing traffic overhead, throughput, delay and packet loss for three protocols which are listed by the Internet Engineering Task Force Mobile Ad-hoc Networks (MANET) working group. These are the Ad-hoc on demand distance vector routing protocol (AODV), the optimized link state routing protocol (OLSR) and the dynamic MANET on demand routing protocol (DYMO).     

An efficient and intelligent routing strategy for vehicular delay tolerant networks

The vehicular delay-tolerant network is the real-life application based area of Delay tolerant network where communication takes place using vehicular nodes and roadside units. The topology used in vehicular networks is highly dynamic by architecture due to the use of moving vehicular nodes. It operates in such a scenario where a direct path between source and destination remains absent on the most piece of the time. In case of non-existence of connected path vehicular delay-tolerant network works opportunistically and uses the same store, carry, and forward paradigm as Delay Tolerant Network. However, the routing protocols designed for vehicular delay-tolerant network faces crucial challenges like inadequate relay node, incomplete data transfer, a large number of packet drop, and uncertain delivery time. In this research paper, we propose a novel routing strategy for the vehicular delay-tolerant network. The proposed routing strategy selects efficient vehicular relay node for complete packet transfer and intelligently reduces the packet drop for timely packet delivery. We implement the proposed routing strategy in the ONE simulator; the ONE simulator provides an opportunistic environment for nodes. We analyze the performance of the proposed strategy under various simulations results using different parameters. The results show that the proposed strategy outperforms standard routing protocols in terms of considered parameters and provide an efficient solution for the problem of disconnection.

     

End-to-End Performance Improvement of the Wireless Channel for Video Transmission

Real time video transmission in wireless environment considers various parameters of wireless channel like information rate, error resiliency, security, end-to-end latency, quality of service etc. The available internet protocols are transmission control protocol and user datagram protocol (UDP). But most of the real-time applications uses UDP as their transport protocol. UDP is a fast protocol suitable for delay sensitive applications like video and audio transmission as it does not provide flow control or error recovery and does not require connection management. Due to the tremendous growth in wired and wireless real-time applications, some improvements should be made in the existing systems or protocols. Various techniques to improve end-to-end performance of system for real time video transmission over wireless channel are available in literature. Authors claim that the solution suggested in the paper provide more reliability in wireless video transmission. In the proposed solution, adaptive redundant packets are added in every block (or datagram) transmitted in order to achieve a desired recovery rate at the receiver. The suggested method dose not use any retransmission mechanism. The network simulator NS-2 is used to evaluate the method and the simulation results indicate that the proposed method can guarantee satisfied end-to-end performance by increased packet delivery ratio, reduced end-to-end delay and hence increased network throughput for video transmission in wireless network.     

Ad Hoc网络中基于协商机制的QoS多播路由研究

针对移动Ad Hoc网络QoS多播路由中普遍存在的拥塞问题,提出了一种基于协商机制的QoS多播路由协议,节点协商使用以一定QoS约束建立起的多播链路,避免过度使用多播资源引起网络拥塞,从而提高分组投递率和网络吞吐量。通过NS2仿真证明,该协议能够保证不同类型业务在网络中传输的服务质量,提高网络的利用率。     

A path selection based routing protocol for urban vehicular ad hoc network (UVAN) environment

Routing in urban environment is a challenging task due to high mobility of vehicles in the network. Many existing routing protocols only consider density, link connectivity, delay, and shortest path information to send the data to the destination. In this paper, a routing protocol is proposed which uses the urban road network information such as multi-lane and flyover to send the data to the destination with a minimum packet forwarding delay. The next path for data forwarding is selected based on a path value calculated by the Road Side Unit for each path connected to a junction. This protocol uses Ground Vehicle to Ground Vehicle (GV2GV) communication, Flyover Vehicle to Flyover Vehicle (FV2FV) communication, and Flyover Vehicle to Ground Vehicle/Ground Vehicle to Flyover Vehicle (FV2GV/GV2FV) communication to enhance the routing performance. Simulation results show that proposed protocol performs better than P-GEDIR, GyTAR, A-STAR, and GSR routing protocols in terms of end-to-end delay, number of network gaps, and number of hops.     

Bayesian inference of network loss and delay characteristics with applications to TCP performance prediction

In large-scale dynamic communication networks, end systems cannot rely on the network itself to cooperate in characterizing its own behavior. This has prompted research activities on methods for inferring internal network behavior based on the external end-to-end network measurements. In particular, knowledge of the link losses and link delays inside the network is important for network management. However, it is impractical to directly measure packet losses or delays at every router. On the other hand, measuring end-to-end (from sources to destinations) losses or delays is relatively easy. We formulate the problems of link and delay estimation in a network based on end-to-end measurements as Bayesian inference problems and develop several Markov chain Monte Carlo (MCMC) algorithms to solve them. We show how these link loss and delay estimates can be used to predict point-to-point transfer control protocol (TCP) throughput in the network. We apply the proposed link loss and delay estimation algorithms, as well as the TCP throughput estimation algorithms, to data generated by the network simulator (ns-2) software and obtain good agreements between the theoretical results and the actual measurements.     

Performance Evaluation of Video Streaming Over Ad Hoc Networks Using Flat and Hierarchical Routing Protocols

A performance evaluation of real time services (such as video streaming) over mobile ad-hoc networks using both hierarchical and flat routing protocols is shown in this paper. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network have been simulated using NS-2. We use OLSR (Optimized Link State Protocol) as the flat routing protocol and our own implementation of HOLSR (Hierarchical OLSR)—which uses HNA (Host and Network Association) messages—as the hierarchical one, modifying other previous HOLSR version and maintaining the maximum compatibility with the flat OLSR. We carry out a complete comparison between these protocols focused on video evaluation. The simulation lets us compare the quality of service (QoS) of the video streaming paying attention to objective parameters (PSNR, packet delivery ratio, packet delay and interruptions). Some drawbacks of the hierarchical environment are also analyzed, as the link load between cluster heads and the lack of QoS-state-aware in HOLSR design. Quantitative results indicate that the protocol overhead is reduced (more than 40% in larger networks) and the video quality is improved (from 1 to 6 dB in certain cases) using hierarchical protocols.     

Link failure and congestion-aware reliable data delivery mechanism for mobile ad hoc networks

Link failures and packet drops due to congestion are two frequently occurring problems in mobile ad hoc networks, degrading the network performance significantly. In this paper, we propose a link failure and congestion-aware reliable data delivery (LCRDD) mechanism that jointly exploits local packet buffering and multilevel congestion detection and control approaches for increasing the data delivery performance. On the detection of link failure or congestive state, an LCRDD intermediate node buffers the incoming data packets at the transport layer queue and resumes transmission when the route is repaired locally. In addition, LCRDD’s multilevel congestion detection helps it to take the most appropriate action proactively. Thus, it offers increased reliability and throughput and decreased end-to-end packet delivery delay and routing overhead compared to state-of-the-art protocols, as shown in results of performance evaluations carried out in network simulator v-2.34.     

Ant-based routing and QoS-effective data collection for mobile wireless sensor network

Mobility management in mobile wireless sensor networks (MWSNs) is a complex problem that must be taken into account. In MWSN, nodes move in and out of the network randomly. Hence, a path formed between two distant nodes is highly susceptible to changes due to unpredictable node movement. Also, due to the limited resources in WSN, the paths used for data transmission must be tested for the link quality and time consumed for data forwarding. In order to solve these issues, in this paper, an ant-based routing protocol with QoS-effective data collection mechanism is proposed. In this protocol, the link quality and link delay are estimated for each pair of nodes. Link quality is estimated in terms of packet reception rate, received signal strength indicator, and link quality index. A reliable path is chosen from the source to the destination based on the paths traversed by forward ants and backward ants. Then, if the link is found to be defective during data transmission, a link reinforcement technique is used to deliver the data packet at the destination successfully. The mobile robots collect the information with high data utility. In addition, each mobile robot is equipped with multiple antennas, and space division multiple access technique is then applied for effective data collection from multiple mobile robots. Simulation results show that the proposed routing protocol provides reliability by reducing the packet drop and end-to-end delay when compared to the existing protocols.     

移动Ad hoc网络多目标路由协议的仿真分析

传统的单目标路由协议很难完全满足Ad hoc网络业务量增加的需求.多目标路由协议在传输过程中可以构建最佳的多目标路由树,链路带宽消耗较小,节点的处理较少,分组交付时延较短,从而降低了通信开销.对Adhoc网络中的典型多目标路由协议MAODV和ODMRP协议进行性能分析,并用仿真工具NS2对它们进行仿真.仿真结果表明：多目标路由协议只有采用更加合理的算法和策略才能使其更稳定和更高效.     

SDR: A Stable Direction-Based Routing for Vehicular Ad Hoc Networks

A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.     

Load balancing routing with queue overflow prediction for WSNs

The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

     

Mobility aware and dual phase AODV protocol with adaptive hello messages over vehicular ad hoc networks

Establishing stable routes over high mobility networks is a challenging field and consequently brought the attention of a lot of current researchers. In this article, a new reactive routing protocol has been proposed which is considered as a major extension of both Ad-hoc On-demand Distance Vector (AODV) and Mobility and Direction Aware AODV (MDA-AODV) prior routing protocols. It is named as Mobility Aware and Dual Phase Ad-hoc On-demand Distance Vector with Adaptive Hello Messages (MA-DP-AODV-AHM). It primarily concentrates on building routes considering vehicles’ speeds and direction of motion with respect to source vehicles, thereby establishing more stable routes and reducing the route breakages. Not only to this extent, but rather, we proposed an adaptive control packet announcement mechanism, which is directly connected to the periodic hello messages approach, with vehicles’ speeds, yielding a significant reduction in the amount of control overhead and congestion over the network. Moreover, the new protocol is proposed to alternate working among two phases, for the reason of guaranteeing the generation of efficient routes on a timely basis, which include MA-DP-AODV-AHM and AODV protocols. Our protocol has been evaluated in terms of control overhead, end-to-end delay, and energy consumption using QualNet simulator version 7.1 in which enormous simulations have been conducted under the base of vehicle density, packet rate, and constant bit rate connections. Simulation results summarize that MA-DP-AODV-AHM contributes efficiently in mitigating the network instability through generating effective stable routes and reducing link failures. Furthermore, it has proved its superiority over AODV and MDA-AODV.     

Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks

In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-forward approach. In this paper, an opportunistic routing protocol is proposed, along with its compatible media access control, for non-real-time services in delay-tolerant networks. The scheme is mobility-aware such that each network node needs to know its own position and velocity. The media access control employs a four-fold handshake procedure to probe the wireless channel and cooperatively prioritize candidate nodes for packet replication. It exploits the broadcast characteristic of the wireless medium to utilize long-range but unreliable links. The routing process seizes opportunities of node contacts for data delivery. It takes a multiple-copy approach that is adaptive with node movements. Numerical results in mobile ad hoc networks and vehicular ad hoc networks show superior performance of the proposed protocol compared with other routing protocols. The mobility-aware media access control and routing scheme exhibits relatively small packet delivery delay and requires a modest amount of total packet replications/transmissions.     

Contention-based reservation protocols in multiwavelength opticalnetworks with a passive star topology

In a multiwavelength optical network with tunable transceivers, an algorithm to make the transmitter and the receiver tuned to the same wavelength simultaneously is needed. The paper proposes contention-based reservation protocols using a separate control channel for multiwavelength optical networks with a passive star topology. First, they present a protocol which can be used in the network where the ratio of the end-to-end signal propagation delay to the transmission time of a data packet is smaller than 1. Also, for a very high speed network where this ratio is greater than 1, the authors present three protocols according to the variability of the packet length and the buffering of the reservation. To access the control channel, all the proposed protocols use the slotted ALOHA protocol. The authors analyze these protocols with a finite population model and investigate the delay-throughput characteristics     

Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios

Disasters create emergency situations and the services provided must be coordinated quickly via a communication network. Mobile adhoc networks (MANETs) are suited for ubiquitous communication during emergency rescue operations, since they do not rely on infrastructure. The route discovery process of on-demand routing protocols consumes too much bandwidth due to high routing overhead. Frequent route changes also results in frequent route computation process. Energy efficiency, quick response time, and scalability are equally important for routing in emergency MANETs. In this paper, we propose an energy efficient reactive protocol named Weighted-CDSR for routing in such situations. This protocol selects a subset of network nodes named Maximum Weighted Minimum Connected Dominating Set (MWMCDS) based on weight, which consists of link stability, mobility and energy. The MWMCDS provides the overall network control and data forwarding support. In this protocol, for every two nodes u and v in the network there exists a path between u and v such that all intermediate nodes belong to MWMCDS. Incorporating route stability into routing reduces the frequency of route failures and sustains network operations over an extended period of time. With fewer nodes providing overall network control and data forwarding support, the proposed protocol creates less interference and consumes less energy. The simulation results show that the proposed protocol is superior to other protocols in terms of packet delivery ratio, control message overhead, transmission delay and energy consumption.