Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed ...Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.展开更多
Broadcasting is an important operation and been widely used in wireless sensor networks （WSNs）. These networks are power constrained as nodes operate with limited battery power. Wireless sensor networks are spatial ...Broadcasting is an important operation and been widely used in wireless sensor networks （WSNs）. These networks are power constrained as nodes operate with limited battery power. Wireless sensor networks are spatial graphs that have much more clustered and much high path-length characteristics. After considering energy- efficient broadcasting in such networks, by combining the small-world characteristic of WSNs and the properties of ant algorithm to quickly identify an optimal path, small-world power-aware broadcast algorithm is introduced and evaluated. Given different densities of network, simulation results show that our algorithm significantly improves life of networks and also reduces communication distances and power consumption.展开更多
In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retra...In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).展开更多
With the increasing popularity of wireless sensor network and GPS （ global positioning system）, uncertain data as a new type of data brings a new challenge for the traditional data processing methods. Data broadcast...With the increasing popularity of wireless sensor network and GPS （ global positioning system）, uncertain data as a new type of data brings a new challenge for the traditional data processing methods. Data broadcast is an effective means for data dissemination in mobile networks. In this paper, the def＇mition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for uncertain data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted uncertain data effectively at the cost of a minor increase in data access time, in the case of no transmission error and presence of transmission errors. As a result, lower uncertainty of data benefits the qualifies of the query results based on the data.展开更多
Ⅰ. INTRODUCTION Broadcast is the process of message dissemination in a communication network whereby a message, originated by a node (originator), is transmitted to all the other nodes of the network. This concept fi...Ⅰ. INTRODUCTION Broadcast is the process of message dissemination in a communication network whereby a message, originated by a node (originator), is transmitted to all the other nodes of the network. This concept finds wide applications in the control of distributed systems. Broadcast considered in this note possesses the following constraints:展开更多
Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last ...Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There are many challenging tasks in the network, including redundancy control and sensor node localization that mainly depend on broadcasting. In this paper, we propose a broadcasting algorithm to control redundancy and improve localization （BACRIL） in WSNs. The proposed algorithm incorporates the benefits of the gossip protocol for optimizing message broadcasting within the network. Simulation results show a controlled level of redundancy, which is up to 57.6% if the number of sensor nodes deployed in a 500 m×500 m area are increased from 50 to 500.展开更多
Broadcasting is a fundamental operation in any wireless networks, more so in wireless ad hoc sensor networks, where each sensor node has limited transmission range as well as battery power. Although broadcasting in wi...Broadcasting is a fundamental operation in any wireless networks, more so in wireless ad hoc sensor networks, where each sensor node has limited transmission range as well as battery power. Although broadcasting in wireless ad hoc sensor networks has many advantages but it can cause serious problems like-broadcast storm, which could cause a lot of contention, redundant retransmission, collision and most importantly, drain immense amount of energy from limited battery powered sensor nodes. In this work, our objective is to reduce the number of retransmission and energy consumption of sensor nodes by using the duty cycle property of wireless ad hoc sensor networks. We propose a preamble-based broadcasting technique for wireless ad hoc sensor networks. We show that in dense wireless ad hoc sensor networks a small size preamble can give maximum network-wide data dissemination rather than using the large preamble, which will only consume immense amount of energy during packet reception.展开更多
In wireless quantum networks, nodes communicate by means of pre-distribution for entangled pairs and relay path establishment for quantum teleportation. However, simple point-to-point communication seriously restricts...In wireless quantum networks, nodes communicate by means of pre-distribution for entangled pairs and relay path establishment for quantum teleportation. However, simple point-to-point communication seriously restricts the efficiency of quantum communication. Inspired by sharing idea of quantum secret sharing (QSS), which is based on three collaborative nodes with pre-shared GHZ (Greenberger-Horne-Zeilinger) states, we propose a quantum secret broadcast scheme to improve network performance. In a cluster net-work cored on three parties of QSS, three cluster heads with pre-shared GHZ states are senders, while cluster members are receivers. One cluster head encodes secret messages on auxiliary particles by performing certain operations on them with GHZ particles, then three cluster heads measure their own par-ticles and broadcast measurement results honestly. Based on the specific correlation of measurement results and secret messages, all receivers can re-cover the secret messages. Furthermore, to prevent eavesdropping, cluster heads can update an encoding key periodically. Analysis shows the proposed scheme is more efficient than previous schemes in wireless quantum net-works, especially when the number of receivers is larger. Besides, in the proposed scheme, attacks on quantum channel based on GHZ state can be detected, and eavesdroppers cannot recover messages correctly for lack of suitable decoding key.展开更多
Broadcasting is used as a building block in many MANET (Mobile Ad hoc Network) routing protocols. In addition, broadcasting is a key primitive in ad hoc networks to support group-based applications. Efficiently suppor...Broadcasting is used as a building block in many MANET (Mobile Ad hoc Network) routing protocols. In addition, broadcasting is a key primitive in ad hoc networks to support group-based applications. Efficiently supporting broadcasting in multihop wireless networks is therefore important. In this paper, we compare ef-ficient broadcasting protocols based on packet forwarding with those based on network coding. Using a number of network scenarios, we derive lower bounds for the required number of packet retransmissions at the MAC layer to support broadcast with and without applying network coding techniques. We compare these lower bounds with each other, as well as with protocols proposed for each approach. More specifically, we use SMF and PDP as sample forwarding-based broadcast protocols, and a simple XOR-based coding protocol over SMF and PDP as representative network coding solution. The results show that neither packet forwarding protocols nor network coding protocols achieve the theoretical lower bounds, in particular as the size of the network area (at constant density) increases. The comparison of the lower bounds also shows that network coding does have a potential performance advantage over packet forwarding solutions for broad-casting in multi-hop wireless networks, in particular for larger fixed density networks, justifying its inherent increased complexity.展开更多
A primary goal of broadcasting in vehicular ad hoc network (VANET) is to improve the road safety by transmitting alert messages to all surrounding vehicles as soon as possible. In this paper, we adopt the concept of o...A primary goal of broadcasting in vehicular ad hoc network (VANET) is to improve the road safety by transmitting alert messages to all surrounding vehicles as soon as possible. In this paper, we adopt the concept of opportunistic routing and propose a multiple candidate relays opportunistic broadcast (MCROB) protocol for VANET. The MCROB protocol is a sender-driven broadcast scheme independent of node density. The packet delivery ratio (PDR) is derived and an expected transmission speed (ETS) for the MCROB is proposed. A priority rule for selecting a proper candidate relay and an adaptive algorithm for forwarding timers of candidate relays are also presented in this paper. Simulations show that MCROB is adaptive to the rapid changing of network conditions. It keeps a low communication overhead introduced by the broadcast and increases the average transmission speed by around 40%.展开更多
We consider the energy minimization problem for a two-cell broadcasting system, where the focus is devising energy efficient joint power control and scheduling algorithms. To improve the retransmission efficiency, lin...We consider the energy minimization problem for a two-cell broadcasting system, where the focus is devising energy efficient joint power control and scheduling algorithms. To improve the retransmission efficiency, linear network coding is applied to broadcast packets. Combined with network coding, an optimal algorithm is proposed, which is based on dynamic programming. To reduce computational complexity, two sub-optimal algorithms are also proposed for large networks. Simulation results show that the proposed schemes can reduce energy consumption up to 57% compared with the traditional Automatic Repeat-reQuest (ARQ).展开更多
Recent advances in wireless sensor networks and GPS have made constantly-evolving data a new type of data which bring a new challenge to traditional data processing methods. Data broadcasting is an effective means for...Recent advances in wireless sensor networks and GPS have made constantly-evolving data a new type of data which bring a new challenge to traditional data processing methods. Data broadcasting is an effective means for data dissemination in asymmetric communication networks, such as wireless networks. In this paper, definition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for constantly-evolving data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted constantly-evolving data effectively at the cost of minor increase in data access time, in the case of no transmission error, transmission errors present, and multiple broadcast channels. As a result it benefits the qualities of the query results based on the data.展开更多
Many previous broadcast encryption schemes can only guarantee confidentiality but cannot verify integrity and authenticity for broadcast messages. In this paper, a broadcast signcryption protocol for ad hoc networks i...Many previous broadcast encryption schemes can only guarantee confidentiality but cannot verify integrity and authenticity for broadcast messages. In this paper, a broadcast signcryption protocol for ad hoc networks is proposed based on cluster-based structure. The proposed protocol not only guarantees confidentiality but also verifies integrity and authenticity for broadcast messages. More importantly, the proposed scheme enables the cluster head to robustly add or remove any cluster member without changing secret key of other cluster members. Moreover, the proposed protocol avoids massive message exchange for key setup among cluster members. The analysis of security and performance shows that the proposed protocol is secure, efficient, and more practical protocol for ad hoc networks.展开更多
Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previou...Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previous studies showed that its efficiency is highly related to the content of clients' cache. However, existing data broadcast systems do not take network coding information into account when making cache replacement decisions. In this paper, we propose two networks coding-aware cache replacement policies called DLRU and DLRU-CP to supplement network coding assisted data broadcast in on-demand broadcast environments. In DLRU, both data access and decoding contribution are taken into account to make replacement decisions. DLRU-CP is based on DLRU but allows clients to retrieve decodable data items that have not been requested yet. The performance gain of our proposed cache replacement policies over traditional cache replacement policy is shown in the simulation results, which demonstrate conclusively that the proposed policies can effectively reduce the overall response time.展开更多
基金supported by the National Natural Science Foundation of China (60775047)Hunan Provincial Natural Science Foundation of China (07JJ6111)
文摘Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.
文摘Broadcasting is an important operation and been widely used in wireless sensor networks （WSNs）. These networks are power constrained as nodes operate with limited battery power. Wireless sensor networks are spatial graphs that have much more clustered and much high path-length characteristics. After considering energy- efficient broadcasting in such networks, by combining the small-world characteristic of WSNs and the properties of ant algorithm to quickly identify an optimal path, small-world power-aware broadcast algorithm is introduced and evaluated. Given different densities of network, simulation results show that our algorithm significantly improves life of networks and also reduces communication distances and power consumption.
基金supported in part by the National Natural Science Foundation of China under Grant No. 61032004the National High Technical Research and Development Program of China (863 Program) under Grants No. 2012AA121605,No. 2012AA01A503,No.2012AA01A510
文摘In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).
基金Initial Research Foundation of Shanghai Second Polytechnic University ( No.001943)National High Technology Research and Development Program of China(863 Program) (No.2007AA01Z309)
文摘With the increasing popularity of wireless sensor network and GPS （ global positioning system）, uncertain data as a new type of data brings a new challenge for the traditional data processing methods. Data broadcast is an effective means for data dissemination in mobile networks. In this paper, the def＇mition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for uncertain data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted uncertain data effectively at the cost of a minor increase in data access time, in the case of no transmission error and presence of transmission errors. As a result, lower uncertainty of data benefits the qualifies of the query results based on the data.
文摘Ⅰ. INTRODUCTION Broadcast is the process of message dissemination in a communication network whereby a message, originated by a node (originator), is transmitted to all the other nodes of the network. This concept finds wide applications in the control of distributed systems. Broadcast considered in this note possesses the following constraints:
文摘Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There are many challenging tasks in the network, including redundancy control and sensor node localization that mainly depend on broadcasting. In this paper, we propose a broadcasting algorithm to control redundancy and improve localization （BACRIL） in WSNs. The proposed algorithm incorporates the benefits of the gossip protocol for optimizing message broadcasting within the network. Simulation results show a controlled level of redundancy, which is up to 57.6% if the number of sensor nodes deployed in a 500 m×500 m area are increased from 50 to 500.
文摘Broadcasting is a fundamental operation in any wireless networks, more so in wireless ad hoc sensor networks, where each sensor node has limited transmission range as well as battery power. Although broadcasting in wireless ad hoc sensor networks has many advantages but it can cause serious problems like-broadcast storm, which could cause a lot of contention, redundant retransmission, collision and most importantly, drain immense amount of energy from limited battery powered sensor nodes. In this work, our objective is to reduce the number of retransmission and energy consumption of sensor nodes by using the duty cycle property of wireless ad hoc sensor networks. We propose a preamble-based broadcasting technique for wireless ad hoc sensor networks. We show that in dense wireless ad hoc sensor networks a small size preamble can give maximum network-wide data dissemination rather than using the large preamble, which will only consume immense amount of energy during packet reception.
文摘In wireless quantum networks, nodes communicate by means of pre-distribution for entangled pairs and relay path establishment for quantum teleportation. However, simple point-to-point communication seriously restricts the efficiency of quantum communication. Inspired by sharing idea of quantum secret sharing (QSS), which is based on three collaborative nodes with pre-shared GHZ (Greenberger-Horne-Zeilinger) states, we propose a quantum secret broadcast scheme to improve network performance. In a cluster net-work cored on three parties of QSS, three cluster heads with pre-shared GHZ states are senders, while cluster members are receivers. One cluster head encodes secret messages on auxiliary particles by performing certain operations on them with GHZ particles, then three cluster heads measure their own par-ticles and broadcast measurement results honestly. Based on the specific correlation of measurement results and secret messages, all receivers can re-cover the secret messages. Furthermore, to prevent eavesdropping, cluster heads can update an encoding key periodically. Analysis shows the proposed scheme is more efficient than previous schemes in wireless quantum net-works, especially when the number of receivers is larger. Besides, in the proposed scheme, attacks on quantum channel based on GHZ state can be detected, and eavesdroppers cannot recover messages correctly for lack of suitable decoding key.
文摘Broadcasting is used as a building block in many MANET (Mobile Ad hoc Network) routing protocols. In addition, broadcasting is a key primitive in ad hoc networks to support group-based applications. Efficiently supporting broadcasting in multihop wireless networks is therefore important. In this paper, we compare ef-ficient broadcasting protocols based on packet forwarding with those based on network coding. Using a number of network scenarios, we derive lower bounds for the required number of packet retransmissions at the MAC layer to support broadcast with and without applying network coding techniques. We compare these lower bounds with each other, as well as with protocols proposed for each approach. More specifically, we use SMF and PDP as sample forwarding-based broadcast protocols, and a simple XOR-based coding protocol over SMF and PDP as representative network coding solution. The results show that neither packet forwarding protocols nor network coding protocols achieve the theoretical lower bounds, in particular as the size of the network area (at constant density) increases. The comparison of the lower bounds also shows that network coding does have a potential performance advantage over packet forwarding solutions for broad-casting in multi-hop wireless networks, in particular for larger fixed density networks, justifying its inherent increased complexity.
基金supported by National Natural Science Foundation of China (No.61070043)
文摘A primary goal of broadcasting in vehicular ad hoc network (VANET) is to improve the road safety by transmitting alert messages to all surrounding vehicles as soon as possible. In this paper, we adopt the concept of opportunistic routing and propose a multiple candidate relays opportunistic broadcast (MCROB) protocol for VANET. The MCROB protocol is a sender-driven broadcast scheme independent of node density. The packet delivery ratio (PDR) is derived and an expected transmission speed (ETS) for the MCROB is proposed. A priority rule for selecting a proper candidate relay and an adaptive algorithm for forwarding timers of candidate relays are also presented in this paper. Simulations show that MCROB is adaptive to the rapid changing of network conditions. It keeps a low communication overhead introduced by the broadcast and increases the average transmission speed by around 40%.
文摘We consider the energy minimization problem for a two-cell broadcasting system, where the focus is devising energy efficient joint power control and scheduling algorithms. To improve the retransmission efficiency, linear network coding is applied to broadcast packets. Combined with network coding, an optimal algorithm is proposed, which is based on dynamic programming. To reduce computational complexity, two sub-optimal algorithms are also proposed for large networks. Simulation results show that the proposed schemes can reduce energy consumption up to 57% compared with the traditional Automatic Repeat-reQuest (ARQ).
基金supported by the National High-Technology Research and Development Program of China (Grant No.2007AA01Z309)the National Natural Science Foundation of China (Grant No.60203017)
文摘Recent advances in wireless sensor networks and GPS have made constantly-evolving data a new type of data which bring a new challenge to traditional data processing methods. Data broadcasting is an effective means for data dissemination in asymmetric communication networks, such as wireless networks. In this paper, definition of the mean uncertainty ratio of data is presented and a broadcasting scheme is proposed for constantly-evolving data dissemination. Simulation results show that the scheme can reduce the uncertainty of the broadcasted constantly-evolving data effectively at the cost of minor increase in data access time, in the case of no transmission error, transmission errors present, and multiple broadcast channels. As a result it benefits the qualities of the query results based on the data.
基金Supported by the National Natural Science Foundation of China (61070164)the Natural Science Foundation of Guangdong Province (81510632010000022)the Science and Technology Planning Project of Guangdong Province (2010B010600025)
文摘Many previous broadcast encryption schemes can only guarantee confidentiality but cannot verify integrity and authenticity for broadcast messages. In this paper, a broadcast signcryption protocol for ad hoc networks is proposed based on cluster-based structure. The proposed protocol not only guarantees confidentiality but also verifies integrity and authenticity for broadcast messages. More importantly, the proposed scheme enables the cluster head to robustly add or remove any cluster member without changing secret key of other cluster members. Moreover, the proposed protocol avoids massive message exchange for key setup among cluster members. The analysis of security and performance shows that the proposed protocol is secure, efficient, and more practical protocol for ad hoc networks.
基金Sponsored by the Research Grants Council of the Hong Kong Special Administrative Region,China ( Grant No. CityU 7002702)the Social Science Foundation from the Ministry of Education,China ( Grant No. 10YJC630021 )the National Natural Science Foundation of China ( Grant No.71202120)
文摘Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previous studies showed that its efficiency is highly related to the content of clients' cache. However, existing data broadcast systems do not take network coding information into account when making cache replacement decisions. In this paper, we propose two networks coding-aware cache replacement policies called DLRU and DLRU-CP to supplement network coding assisted data broadcast in on-demand broadcast environments. In DLRU, both data access and decoding contribution are taken into account to make replacement decisions. DLRU-CP is based on DLRU but allows clients to retrieve decodable data items that have not been requested yet. The performance gain of our proposed cache replacement policies over traditional cache replacement policy is shown in the simulation results, which demonstrate conclusively that the proposed policies can effectively reduce the overall response time.
