一种适合于无线网络的竞争广播算法

广播是无线网络中基本且重要的操作.竞争广播算法是一种基于竞争机制的广播协议算法,适合于移动自组网络.分析和仿真结果表明,与泛洪方案相比,竞争广播算法去除了大量冗余转播,改善了网络的广播性能,提高了网络的吞吐量.另外,竞争广播算法思想还能应用于其他网络协议,如应用于路由协议的路由发现过程,提高路由算法的性能等.     

The Broadcast Storm Problem in a Mobile Ad Hoc Network

Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.     

Relative degree adaptive flooding broadcast algorithm for ad hoc networks

Broadcasting has been widely used in mobile Ad hoc networks as a communication means to disseminate information to all reachable nodes. Because radio signals are likely to overlap with others in a geographical area, straightforward broadcasting by flooding becomes very costly and results in serious redundancy, contention and collision, to which we refer as the broadcast storm problem. In this paper we propose the Relative Degree Adaptive flooding Broadcast (RDAB) algorithm for Ad hoc networks to efficiently reduce the broadcast overhead in the network. Based on the current situation of the network and the degree of the nodes, RDAB calculates the relative degree of the nodes, decides which nodes need to re-transmit and which nodes only need to receive. The higher the neighbor node's relative degree, the more uncovered nodes it can cover, hence these nodes can be selected to re-transmit broadcasting packets in the networks. We analyze the reliability and the validity of the RDAB algorithm to prove that the RDAB algorithm is a valid flooding broadcast algorithm. Simulation results show that the RDAB strategy outperforms the Ordinary Flooding Broadcast Method (OBM) and the Multipoint Relaying (MPR) protocol for Ad hoc networks.     

Performance Analysis of Adjusted Probabilistic Broadcasting in Mobile Ad Hoc Networks

Broadcasting in Mobile Ad Hoc Networks (MANETs) is a fundamental data dissemination mechanism with a number of important applications in, e.g., route discovery, address resolution. However, broadcasting induces what is known as the “broadcast storm problem” which causes severe degradation in network performance due to excessive redundant retransmission, collision, and contention. Broadcasting in MANETs has traditionally been based on flooding, which simply swamps the network with large number of rebroadcast messages in order to reach all network nodes. Although probabilistic flooding has been one of the earliest suggested schemes to broadcasting, there has not been so far any attempt to analyse its performance behaviour in a MANET environment. In an effort to fill this gap, this paper investigates using extensive ns-2 simulations the effects of a number of important system parameters in a typical MANET, including node speed, pause time, traffic load, and node density on the performance of probabilistic flooding. The results reveal that most of these parameters have a critical impact on the reachability and the number of saved rebroadcast messages achieved by probabilistic flooding.     

Broadcasting in Sensor Networks: The Role of Local Information

Flooding based querying and broadcasting schemes have low hop-delays of $Theta {( {{ 1}over { R(n)}})}$ to reach any node that is a unit distance away, where $R(n)$ is the transmission range of any sensor node. However, in sensor networks with large radio ranges, flooding based broadcasting schemes cause many redundant transmissions leading to a broadcast storm problem. In this paper, we study the role of geographic information and state information (i.e., memory of previous messages or transmissions) in reducing the redundant transmissions in the network.      

CogNS: A Simulation Framework for Cognitive Radio Networks

Cognitive radio technology has been used to efficiently utilize the spectrum in wireless networks. Although many research studies have been done recently in the area of cognitive radio networks (CRNs), little effort has been made to propose a simulation framework for CRNs. In this paper, a simulation framework based on NS2 (CogNS) for cognitive radio networks is proposed. This framework can be used to investigate and evaluate the impact of lower layers, i.e., MAC and physical layer, on the transport and network layers protocols. Due to the importance of packet drop probability, end-to-end delay and throughput as QoS requirements in real-time reliable applications, these metrics are evaluated over CRNs through CogNS framework. Our simulations demonstrate that the design of new network and transport layer protocols over CRNs should be considered based on CR-related parameters such as activity model of primary users, sensing time and frequency.     

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol.     

SOBP: a sender-designated opportunistic broadcast protocol for VANET

Two problems existing in highway vehicular ad hoc networks (VANET), i.e., the slow reaction problem (SRP) and the local broadcast storm problem (LBSP), are investigated. In SRP, a candidate forwarder (CF) close to a sender always rebroadcasts a packet with a low probability or rebroadcasts a packet after a long delay in sparse network, while LBSP occurs when vehicles contending for accessing channel in a local dense network. To solve these problems, a Sender-designated Opportunistic Broadcast Protocol (SOBP) is proposed, which has multiple CFs to broadcast packets and is irrelevant to node density. A sender designates a fixed number of CFs and assigns priorities to them before broadcasting a packet so that possible collisions in the receivers are avoided. To enhance the efficiency of a single transmission, the sender chooses the CFs separated with a certain distance to alleviate the effect of hidden node. The average number of transmissions in a successful broadcast is analyzed and the retransmission strategy to enhance the reliability is presented. One of the main features of SOBP is that it is able to keep broadcasting overhead at a low level. Simulations show that SOBP is able to effectively solve the SRP and the LBSP.     

Mobile ad hoc network broadcasting: A multi‐criteria approach

Nodes in a computer network often require a copy of a message to be delivered to every node in the network. The network layer can provide such a service, referred to as network‐wide broadcast routing or simply ‘broadcasting’. Broadcasting has many applications, including its role as a service to many routing protocols. In a mobile ad hoc network (MANET), simplistic broadcast schemes (such as flooding) inundate the network with redundancy, contention, collision, and unnecessary use of energy resources. This can prevent broadcasts from achieving their primary objective of maximizing delivery ratio, while also considering secondary objectives, such as balancing energy resources or reducing the network's burden on congested or busy nodes. As a solution, we propose multiple‐criteria broadcasting (MCB). In MCB, the source of each broadcast specifies the importance assigned to broadcast objectives. Network nodes use these priorities, along with local and neighbor knowledge of distributed factors, to broadcast in accordance with the objective priorities attributed to the message. Using ns2, the performance of MCB is evaluated and compared to that of other broadcast protocols. To present knowledge, MCB constitutes the first reconfigurable, multi‐objective approach to broadcasting. Copyright © 2010 John Wiley & Sons, Ltd.     

Capacity Analysis in Multi-Radio Multi-Channel Cognitive Radio Networks: A Small World Perspective

Cognitive radio (CR) has emerged as a promising technology to improve spectrum utilization. Capacity analysis is very useful in investigating the ultimate performance limits for wireless networks. Meanwhile, with increasing potential future applications for the CR systems, it is necessary to explore the limitations on their capacity in dynamic spectrum access environment. However, due to spectrum sharing in cognitive radio networks (CRNs), the capacity of the secondary network (SRN) is much more difficult to analyze than that of traditional wireless networks. To overcome this difficulty, in this paper we introduce a novel solution based on small world model to analyze the capacity of SRN. First, we propose a new method of shortcut creation for CRNs, which is based on connectivity ratio. Also, a new channel assignment algorithm is proposed, which jointly considers the available time and transmission time of the channels. And then, we derive the capacity of SRN based on small world model over multi-radio multi-channel (MRMC) environment. The simulation results show that our proposed scheme can obtain a higher capacity and smaller latency compared with traditional schemes in MRMC CRNs.     

基于极大独立集的最小连通支配集的分布式算法

全网范围的广播在无线传感器网络和移动自组织网络中有着广泛的应用.为节省网络资源,减少冗余转发节点成为广播中需解决的关键问题.广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价,而在任意图中求解最小连通支配集是NP完全问题.本文基于极大独立集,提出了一种求解最小连通支配集的分布式算法(MISB),并证明了算法的正确性.仿真结果表明,使用该算法能得到较小的连通支配集,从而有效减少网络广播过程中的转发节点数,大大节省了网络资源.     

Collision avoidance in TV white spaces: a cross-layer design approach for cognitive radio networks

One of the most promising applications of cognitive radio networks (CRNs) is the efficient exploitation of TV white spaces (TVWSs) for enhancing the performance of wireless networks. In this paper, we propose a cross-layer design (CLD) of carrier sense multiple access with collision avoidance (CSMA/CA) mechanism at the medium access control (MAC) layer with spectrum sensing (SpSe) at the physical layer, for identifying the occupancy status of TV bands. The proposed CLD relies on a Markov chain model with a state pair containing both the SpSe and the CSMA/CA from which we derive the collision probability and the achievable throughput. Analytical and simulation results are obtained for different collision avoidance and SpSe implementation scenarios by varying the contention window, back off stage and probability of detection. The obtained results depict the achievable throughput under different collision avoidance and SpSe implementation scenarios indicating thereby the performance of collision avoidance in TVWSs-based CRNs.     

Network condition and application‐based data adaptive intelligent message routing in vehicular network

Recent advances in intelligent transportation systems enable a broad range of potential applications that significantly improve the vehicle and road safety and facilitate the efficient dissemination of information among the vehicles. To assist the vehicle traffic, message broadcasting is a widely adopted technique for road safety. But efficient message broadcasting is a significant issue, especially in a high network density due to the broadcast storm problem. To solve this issue, several methods are proposed to eliminate the redundant transmission of safety packets. However, they lack in restricting the broadcasting region of safety messages, and the transmissions of safety packets outside the dangerous region, and force the vehicles to unnecessary detours. This paper proposes an adaptive multimode routing protocol, network condition, and application‐based data adaptive intelligent message routing in vehicular network (NetCLEVER) that supports 2 modes of operation such as message broadcasting and intelligent routing. In message broadcasting mode, the NetCLEVER decides the dangerous region of the network by considering the changes of neighbor vehicles velocity, instead of current vehicle velocity, because a vehicle decision in velocity is interdependent with the preceding vehicles. In intelligent routing mode, the NetCLEVER exploits the cuckoo search optimization in routing by taking into account multiple routing factors such as the road topology of intersections and traffic signals and their impact on link stability, which improves the reliability of routing packets significantly. The performance evaluation illustrates that the proposed NetCLEVER improves reliable wireless communication as well as road safety in vehicular ad hoc networks.     

电视播控系统网络及服务器备份策略

随着科技的进步,电视播控系统网络也在不断发展,但是电视播控系统网络的安全以及做好服务器备份工作不容忽视.国家广电局也颁布了《广播电视播出管理规定》,对维护电视播控系统网络和服务器备份做出了明确规定,提出要对操作系统、服务器配置参数以及其他应用软件进行备份等,注意净化电视播控系统网络.本文将简单针对如何维护电视播控网络安全与做好备份工作提出个人建议,希望能够为网络电视技术提供参考.     

认知无线电网络中的自组织优化方法（英文）

Cognitive radio(CR) is regarded as a promising technology for providing a high spectral efficiency to mobile users by using heterogeneous wireless network architectures and dynamic spectrum access techniques.However,cognitive radio networks(CRNs)may also impose some challenges due to the ever increasing complexity of network architecture,the increasing complexity with configuration and management of large-scale networks,fluctuating nature of the available spectrum,diverse Quality-of-Service(QoS)requirements of various applications,and the intensifying difficulties of centralized control,etc.Spectrum management functions with self-organization features can be used to address these challenges and realize this new network paradigm.In this paper,fundamentals of CR,including spectrum sensing,spectrum management,spectrum mobility and spectrum sharing,have been surveyed,with their paradigms of self-organization being emphasized.Variant aspects of selforganization paradigms in CRNs,including critical functionalities of Media Access Control(MAC)- and network-layer operations,are surveyed and compared.Furthermore,new directions and open problems in CRNs are also identified in this survey.     

Cluster based emergency message broadcasting technique for vehicular ad hoc network

Broadcasting is one of the major emergency services of Vehicular ad hoc network, since the number of vehicles increases every day. Because of the high density of the vehicles, it is necessary to broadcast emergency messages to all the vehicles to avoid traffic jam and vehicle accidents. Reliable broadcasting of messages in self-organizing Ad hoc networks is a promising research field. In this paper a cluster based emergency message broadcasting algorithm is proposed. In this regard we have proposed cluster based architecture for emergency message dissemination and collision avoidance in VANET. In this paper, first the formation of cluster is done in such a way that it avoids any kind of collision. Once cluster head is selected it takes the responsibility of intra cluster management to avoid interference between the clusters. To increase the reliability during emergency message dissemination two MAC layer broadcasts protocol is used. This assures that message is delivered on time without any hazards. The proposed model is simulated for DSDV, AODV, and DSR protocols with the standards 802.11 and 802.11p in SHWM, Manhattan and freeway mobility models.     

Trusted cognitive radio networking

Networking cognitive radios and nodes from primary system (PS) results in a heterogeneous coexisting multi‐radio wireless network, so that significant network throughput gain can be achieved. However, by investigating cognitive radio network (CRN) architecture, the links in CRNs are unlikely to support complete security check due to link dynamics, opportunistic availability, and uni‐directional in available time window. We therefore introduce trusted cognitive radio networking (TCRN) concept to facilitate network functions such as association in dynamic spectrum access and routing. First of all, we explore the mathematical framework for trust in CRNs. We then show successful association of node to CRN based on the mathematical structure of trust from statistical decision theory. Furthermore, we modify the machine‐learning algorithm to update the trust measure for each node, and develop rules of thumbs to facilitate TCRN with learning capability, based on numerical simulations. Trusted CRN can greatly alleviate heterogeneous challenge for CRN operation. Copyright © 2009 John Wiley & Sons, Ltd.     

Improving broadcast performance by traffic isolation in wireless ad hoc networks

In this paper we propose a new broadcasting algorithm. In the proposed method we significantly reduce the broadcast overhead and also improve the broadcast delivery ratio in mobile networks. A novel traffic isolation method has been used which reduces the control message exchange. The proposed broadcasting method is based on a clustering method called ‘stability‐based clustering algorithm’ which had been proposed before. The broadcasting traffic is divided into internal (flow inside a cluster) and external traffic (flow among the clusters). For internal flooding traffic, cluster‐heads and gateways are responsible for re‐broadcasting but for external type, border nodes may perform the forwarding function as well. This simplifies the gateway selection method through the local selection of gateway nodes by its cluster head. Therefore, a cluster head selects gateway in its own cluster without any knowledge of other clusters. Considering the effect of mobility and node density, simulations have been conducted in a number of wireless environments. Simulation results show the broadcast coverage is close to 100% at different node speeds. Moreover, we study the broadcast parameters in light and dense networks and show improvement of the overhead and the number of forward nodes in comparison to other broadcasting methods. Copyright © 2005 John Wiley & Sons, Ltd.     

关于中国数字声音广播的讨论

随着数字化技术的深入发展及音频广播业的不断扩大,音频广播数字化的发展获得了强劲的推动力.目前国际上主流的数字声音广播技术有数字音频广播(DAB)、数字调幅广播(DRM)、数字高清广播(HD-Radio)等,这些技术各有其优势特点,但也各有适用性.探讨了中国数字化声音广播的发展方向,介绍了一种全新的带内高清数字广播技术系...     

Polygonal broadcast, secret maturity, and the firing sensors

This work considers communication among sensors that are deployed in a geographic region. Each sensor is a computing device with severe resource limitations, low power, slow processing and small memory. The devices are distributed (uniformly) in the geographic region. In this work we present self-stabilizing broadcast, flooding and sense of direction procedures that fit the special characteristics of the system. Imaginary polygon tilings are presented as a general scheme for supporting communication in sensor networks. Broadcasting is a common way of communicating in ad hoc mobile networks such as sensor networks. We present broadcast procedures and show how they are used by a sensor for broadcasting globally and locally, achieving sense of direction and distributing secrets that activate the sensors simultaneously at a particular time without revealing the nature of the upcoming activity.