Broadcast Cost Research Articles

Outdoor Air Quality Monitoring with Enhanced Lifetime-enhancing Cooperative Data Gathering and Relaying Algorithm (E-LCDGRA) Based Sensor Network

The air continues to be an extremely substantial part of survival on earth. Air pollution poses a critical risk to humans and the environment. Using sensor-based structures, we can get air pollutant data in real-time. However, the sensors rely upon limited-battery sources that are immaterial to be alternated repeatedly amid extensive broadcast costs associated with real-time applications like air quality monitoring. Consequently, air quality sensor-based monitoring structures are lifetime-constrained and prone to the untimely loss of connectivity. Effective energy administration measures must therefore be implemented to handle the outlay of power dissipation. In this study, the authors propose outdoor air quality monitoring using a sensor network with an enhanced lifetime-enhancing cooperative data gathering and relaying algorithm (E-LCDGRA). LCDGRA is a cluster-based cooperative event-driven routing scheme with dedicated relay allocation mechanisms that tackle the problems of event-driven clustered WSNs with immobile gateways. The adapted variant, named E-LCDGRA, enhances the LCDGRA algorithm by incorporating a non-beaconaided CSMA layer-2 un-slotted protocol with a back-off mechanism. The performance of the proposed E-LCDGRA is examined with other classical gathering schemes, including IEESEP and CERP, in terms of average lifetime, energy consumption, and delay

The Pricing Strategy of Digital Content Resources Based on a Stackelberg Game

This paper uses a Stackelberg game model to analyze the profit function composition of digital content resource producers and publishers and uses a numerical simulation method to explore the equilibrium relationships between the various factors that affect the pricing strategy. The findings are as follows: ① platform-based publishers of digital content resources adopt a cost-plus pricing method for a single broadcast price; ② the revenue-sharing ratio of the producers decreases as the single broadcast cost increases; ③ the viewing effect is affected by many factors, such as copyright fees, investment difficulty, sales coefficient, and unit cost. Overall, the main contribution of this manuscript is to make an innovative demonstration and analysis of the factors affecting the pricing strategy of digital content resources, and the results of this paper can promote the transaction of digital content resources and ensure the sustainable development of the digital content industry.

Capacity of 2-User Linear Computation Broadcast With Partially Informed Server

A linear computation broadcast (LCBC) setting is comprised of data that is stored at a server and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> users who wish to retrieve their respective desired linear functions of the data, while utilizing knowledge of certain other linear functions available to each user as prior side-information. The goal is to determine the smallest amount of broadcast information from the server that will simultaneously satisfy all the users’ demands. The reciprocal of the optimal broadcast cost is called the capacity of LCBC. The capacity is known for the 2-user setting, and recent studies of 3-user LCBC have revealed new insights into the need for sumset inequalities for LCBC. This letter introduces a generalization of the LCBC problem, where instead of storing all the data, the server may have partial knowledge in the form of some arbitrary linear function of the data. Building upon recent advances, the exact capacity is found for 2-user linear computation broadcast with partially informed server.

Brief analysis on the trend of pan-life live broadcasting in the post-epidemic era

The sudden outbreak of COVID-19 has acted as a catalyst to transform live broadcasting from entertainment to life. The concept of "pan-life live broadcasting" has come into the public's view and gradually occupied the mainstream of live broadcasting under the development of the epidemic. With the advent of the era of after the outbreak, pan live life to the "new" content, various forms of "cloud" live fire through cut, from vulgar transition to the studious, and bring a large number of "new blood" input, update its role and function expanding, has made steady progress in joint daily life on the road, meet the demand of the parties to the audience.Nowadays, with the reduction of the cost of live broadcasting and the increasingly mature supervision of online live broadcasting in China, the future of pan-life live broadcasting is promising.

A low-cost physical location discovery scheme for large-scale Internet of Things in smart city through joint use of vehicles and UAVs

With the development of Information and Communication Technology (ICT), the construction of the smart city came into being. Compared with the traditional city, a smart city can reduce resource consumption, improve energy efficiency, reduce environmental pollution, reduce traffic congestion, reduce potential safety hazards, improve the quality of life of citizens, etc. In order to collect a large amount of data to provide accurate decision-making recommendations for the management of smart cities, a large-scale Internet of Things (IoT) system needs to be built as the basis. For most applications in smart cities, it is very important to obtain the physical location information of the data during the data collection. However, it is a challenging issue for most sensor devices in the IoT system, because sensor devices are hard to equip positioning equipment as limited by cost. To tackle this, a Low-Cost Physical Locations Discovery (LCPLD) Scheme is proposed in this paper. In LCPLD scheme, mobile vehicles and unmanned aerial vehicles (UAVs) are used for physical location discovery on the wireless sensor networks which are the important component of the IoT system in a smart city. In order to further reduce cost, we propose a task application mechanism to reduce the cost of vehicle broadcasting and the Adaptive UAV Flight Path Planning (AUPPP) algorithm to reduce UAV flight cost. In order to reduce localization error, the Large Error Rejection (LER) algorithm and the UAV Same Position Broadcast Repeat (USPBR) algorithm are proposed in this paper. After simulation experiments based on real vehicle driving data, the experimental results prove the effectiveness of the proposed scheme: Compared with the comparison scheme, the LCPLD scheme proposed has a cost reduction of 16.58% ∼19.88%, an average reduction of 78.80% in positioning error, and an average reduction of 99.88% in the variance of positioning error.

On the broadcast independence number of locally uniform 2-lobsters

Let~$G$ be a simple undirected graph. A broadcast on~$G$ is a function $f : V(G)\rightarrow\NNNNN$ such that $f(v)\le e_G(v)$ holds for every vertex~$v$ of~$G$, where $e_G(v)$ denotes the eccentricity of~$v$ in~$G$, that is, the maximum distance from~$v$ to any other vertex of~$G$. The cost of~$f$ is the value $\cost(f)=\sum_{v\in V(G)}f(v)$. A broadcast~$f$ on~$G$ is independent if for every two distinct vertices $u$ and~$v$ in~$G$, $d_G(u,v)>\max\{f(u),f(v)\}$, where $d_G(u,v)$ denotes the distance between $u$ and~$v$ in~$G$. The broadcast independence number of~$G$ is then defined as the maximum cost of an independent broadcast on~$G$. A caterpillar is a tree such that, after the removal of all leaf vertices, the remaining graph is a non-empty path. A lobster is a tree such that, after the removal of all leaf vertices, the remaining graph is a caterpillar. In [M. Ahmane, I. Bouchemakh and E. Sopena. On the Broadcast Independence Number of Caterpillars. Discrete Applied Mathematics, in press (2018)], we studied independent broadcasts of caterpillars. In this paper, carrying on with this line of research, we consider independent broadcasts of lobsters and give an explicit formula for the broadcast independence number of a family of lobsters called locally uniform $2$-lobsters.

Tree and elliptic curve based efficient and secure group key agreement protocol

Group Key Agreement Protocol (GKAP) is a cryptographic mechanism where members of a group agree on a common key by sharing their blinded keys over a public channel. Sharing a key over a public channel is a security threat and expensive in terms of communication cost. In this paper, we proposed the GKAP based on tree and elliptic curve. For reducing the communication cost, we have used the divide-and-conquer mechanism with that group is divided into small subgroups and forming a tree-like structure. The modified Elliptic-Curve-Diffie–Hellman used for sharing the blinded key over a public network channel securely. This paper discussing different group key management operations are initialization, join, mass join, leave, mass-leave, merge with their communication cost are the number of rounds, unicast cost, broadcast cost, messages. This paper discussing the establishment of common keys not only for the group but also for the subgroups. Based on communication cost, we have compared the performance of proposed method with the existing approaches like Communication-Computation Efficient Group Key Algorithm (CCEGK), Tree-based group key agreement (TGDH), Ternary-tree based group key agreement protocol for dynamic group (TTGKAP), Group key generation tree protocol (GKGT), Ternary tree-based group key agreement protocol over elliptic curve for dynamic group (TTEGKAP), Efficient Group key agreement using hierarchical key tree (EGKAKT). From performance analysis, it is cleared that proposed approach performed better in most of the cases than the existing approaches. The proposed approach is safe against passive attack, collaborative attack, forward secrecy, backward secrecy, and man-in-the-middle attack.

The cost of global broadcast in dynamic radio networks

We study the time complexity of single and multi token broadcast in adversarial dynamic radio networks. Initially, k tokens (which are k pieces of information) are distributed among the n nodes of a network and all the tokens need to be disseminated to all the nodes in the network. We first consider the single-token broadcast problem (i.e., the case k=1). By presenting upper and lower bounds, we show that the time complexity of single-token broadcast depends on the amount of stability and connectivity of the dynamic network topology and on the adaptiveness of the adversary providing the dynamic topology. Then, we give two generic algorithms which allow to transform generalized forms of single-token broadcast algorithms into multi-token broadcast (k-token broadcast) algorithms. Based on these generic algorithms, we obtain k-token broadcast algorithms for a number of different dynamic network settings. For one of the modeling assumptions, our algorithm is complemented by a lower bound which shows that the upper bound is close to optimal.

On the broadcast independence number of caterpillars

Let G be a simple undirected graph. A broadcast on G is a function f:V(G)→N such that f(v)≤eG(v) holds for every vertex v of G, where eG(v) denotes the eccentricity of v in G, that is, the maximum distance from v to any other vertex of G. The cost of f is the value cost(f)=∑v∈V(G)f(v). A broadcast f on G is independent if for every two distinct vertices u and v in G, dG(u,v)>max{f(u),f(v)}, where dG(u,v) denotes the distance between u and v in G. The broadcast independence number of G is then defined as the maximum cost of an independent broadcast on G.In this paper, we study independent broadcasts of caterpillars and give an explicit formula for the broadcast independence number of caterpillars having no pair of adjacent trunks, a trunk being an internal spine vertex with degree 2.

On the Cost of Waking Up

Often, in a distributed system, a task must be performed in which all entities must be involved; however only some of them are active, while the others are inactive, unaware of the new computation that has to take place. In these situations, all entities must become active, a task known as Wake-Up. It is not difficult to see that Broadcast is just the special case of the Wake-Up problem, when there is only one initially active entity. Both problems can be solved with the same trivial but expensive solution: Flooding. More efficient broadcast protocols exist for some classes of dense interconnection networks. The research question we examine is whether also wake-up can be performed significantly better in three classes of regular interconnection networks: hypercubes, complete networks, and regular complete bipartite graphs. In a d -dimensional hypercube network of n nodes, the cost of broadcasting is Theta( n ) even if the edge labeling is arbitrary and the network is asynchronous. We show that, instead, wake-up requires Omega( n log n ) message transmissions in the worst case, even if the network is synchronous and has sense of direction. Similarly, in a regular complete bipartite network K p,p of n =2 p anonymous entities the cost of broadcasting is Theta( n ) even if the edge labeling is arbitrary and the network is asynchronous; instead, we show that wake-up requires Theta( n 2 ) message transmissions in the worst case, even if the network is synchronous and has sense of direction. In a complete network K n of n entities, the cost of broadcasting is minimal: n -1 message transmissions suffice even if the entities are anonymous. In this paper we prove that the cost of wake-up is order of magnitude higher. In the case of anonymous entities, Omega( n 2 ) message transmissions are needed in the worst case, even if the network is fully synchronous and has sense of direction. In the case of entities with distinct ids, Omega( n log n ) transmissions need to be performed and the bound is tight. This shows that, when the entities have Ids, Wake-Up is computationally as costly as the apparently more complex Election problem.

Load Balancing Technique Based on Broadcasting and Residual Energy Using Adaptive Clustering Hierarchy Protocol (LBEACH)

One of the important factors of Wireless Sensor Networks (WSNs) is sensors lifetime. Elongating sensors lifetime increases the benefits from the network capabilities as much as possible. To elongate WSNs lifetime, power consumption should be reduced. To do so, load balance technique is applied to distribute the energy consumption among cluster’s nodes in the WSN. In each cluster, the node that acts as Cluster Head (CH) is the one that significantly suffers from power consumption problem. To elongate the WSNs lifetime, different sensor node is elected to act as CH for a period of time (round). Choosing the proper CH per round greatly affects the energy efficiency in the network. In this study, a new protocol for clustered heterogeneous WSNs (called LBEACH) is suggested to reduce power consumption and prolong the network lifetime. Distributed clustering methodology, with a novel algorithm to elect cluster heads in each round, is applied and tested. The elected CH is the node that has the minimal estimated broadcast cost and the highest residual energy. The estimated broadcast cost of each node is the estimated cost needed for sending a message to all other nodes within the same cluster and to the base-station. LBEACH performance is measured using network lifetime, power consumption and throughput. By comparing LBEACH performance with other protocols, Low Energy Adaptive Clustering Hierarchy (LEACH) and Stable Election Protocol (SEP) protocols, it was found that LBEACH shows a significant improvement in the network lifetime, power consumption and throughputs toward Base-Station (BS).

Modeling Routing Overhead of Reactive Protocols at Link Layer and Network Layer in Wireless Multihop Networks

To keep information recent between two nodes, two types of link sensing feed-back mechanisms are used: link layer (LL) and network layer (NL). In this paper, we model and evaluate these link sensing mechanisms in three widely used reactive routing protocols: ad hoc on-demand distance vector (AODV), dynamic source routing (DSR), and dynamic MANET on-demand (DYMO). Total cost paid by a routing protocol is the sum of cost paid in the form of energy consumed (in terms of packet reception/transmission) and time spent (in terms of processing route information). Routing operations are divided into two phases: route discovery (RD) and route maintenance (RM). These protocols majorly focus on broadcast cost optimization performed by expanding ring search (ERS) algorithm to control blind flooding. Hence, our model relates link sensing mechanisms in RD and RM for the selected routing protocols to compute consumed energy and processing time. The proposed framework is evaluated via NS-2, where the selected protocols are tested with different nodes' mobilities and densities.

AmmanNet (Al-Balad) Internet radio in Jordan and the West Bank: or, ‘I have seen the future of radio, and it is AmmanNet’

Abstract Arab states have used terrestrial radio for nationalist mobilization and development extensively in the 1950s and 1960s. However, government restrictions, combined with the high cost of terrestrial broadcasting, kept radio out of private hands. After discussing the technological context that made digital radio possible in Jordan and the West Bank, I trace the development of the first Internet radio station in the Arab world, AmmanNet, and describe its developmental local programming as an example of a new type of media that digitally savvy youth are broadcasting. However, because some of the funding comes from NGOs (non-governmental organizations) and foreign governments, Arabs face a dilemma: accepting such funding provides them with equipment and training they may not otherwise have, but accepting it sometimes restricts their programming choices to discussions of local problems, rather than problems created by the Israeli occupation. Yet foreign funding also provides opportunities to discuss taboo social issues that state media rarely consider airing.

Modeling Routing Overhead of Reactive Protocols at Link Layer and Network Layer in Wireless Multihop Networks

To keep information recent between two nodes, two types of link sensing feed-back mechanisms are used: link layer (LL) and network layer (NL). In this paper, we model and evaluate these link sensing mechanisms in three widely used reactive routing protocols: ad hoc on-demand distance vector (AODV), dynamic source routing (DSR), and dynamic MANET on-demand (DYMO). Total cost paid by a routing protocol is the sum of cost paid in the form of energy consumed (in terms of packet reception/transmission) and time spent (in terms of processing route information). Routing operations are divided into two phases: route discovery (RD) and route maintenance (RM). These protocols majorly focus on broadcast cost optimization performed by expanding ring search (ERS) algorithm to control blind flooding. Hence, our model relates link sensing mechanisms in RD and RM for the selected routing protocols to compute consumed energy and processing time. The proposed framework is evaluated via NS-2, where the selected protocols are tested with different nodes' mobilities and densities.

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The objective is to minimize the total cost of the network-wide broadcast, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based on a simplicial complex model that allows us to capture the broadcast nature of the wireless medium and the heterogeneity across radios and channels. Specifically, we show that broadcasting in multi-radio multi-channel ad hoc networks can be formulated as a minimum spanning problem in simplicial complexes. We establish the NP-completeness of the minimum spanning problem and propose two approximation algorithms with order-optimal performance guarantee. The first approximation algorithm converts the minimum spanning problem in simplical complexes to a minimum connected set cover (MCSC) problem. The second algorithm converts it to a node-weighted Steiner tree problem under the classic graph model. These two algorithms offer tradeoffs between performance and time-complexity. In a broader context, this work appears to be the first that studies the minimum spanning problem in simplicial complexes and weighted MCSC problem.

Efficient broadcasting using packet history in mobile ad hoc networks

Broadcasting is a key component of several networking mechanisms in mobile ad hoc networks. However, its traditional implementation suffers from resource consumption caused by message redundancy. Several efficient algorithms have been proposed to tackle this problem. Among them, the class of algorithms that construct on-demand a connected dominating set, known as dominant pruning, yields an improved performance. Dominant pruning algorithms capitalise on neighbourhood information and the previous hop of the broadcast message in order to minimise the set of nodes that forward a message. The proposed algorithm makes the observation that all the nodes, visited by a broadcast message, may be exploited in order to minimise the cost of broadcasting. The analysis of the proposed algorithm as well as extensive simulation results confirm the rationale behind the proposed approach and prove the performance gains.

Role-based Broadcasting Algorithm in Wireless Sensor Networks

In application-driven environment of wireless sensor networks, the role-based designing is a very important method to realize dynamic application, and role-packet broadcasting is a challenging problem. For large-capacity role-packet, the biggest problem is that there is too much cost in broadcasting. A role-based broadcast algorithm for wireless sensor networks (CRD algorithm) was presented, which use context information to calculate the relying cost function in order to reduce redundancy broadcast cost. On the basis of fully analyzing node's broadcast cost, the CRD algorithm optimizes the relaying cost function according to the requirements of application services and the around environment information of a node. Simulation and performance evaluations were down about broadcast rate, arrival rate, energy consumption. The results showed that the algorithm had high performance advantages in broadcasting the large-capacity role-packet.

Scheduling on-demand data broadcast in mixed-type request environments

In many on-demand broadcast environments, there can be a mix of requests, in which some of the requests have real-time constraints, while other requests have no time constraints associated with them. We refer to such environments as mixed-type environments. Existing strategies for on-demand data in broadcast systems typically only consider how to minimize the wait time of the requests, while scheduling strategies for real-time requests typically only consider how to minimize the number of deadlines missed. How to satisfy both of these constraints is a challenging problem whose solution can benefit many applications. In this paper, we present an on-demand broadcast cost model that is more general than existing broadcast cost models because it considers both response time and number of deadlines missed. An analysis of the system is presented as a Markov decision process to ascertain the feasibility of an optimal policy. We propose two scheduling strategies for mixed-type broadcast systems that are based on our cost model: maximum paid cost first and maximum value gained first. The simulation results show that both of our strategies always achieve the best result, when compared to existing broadcast strategies, for varying request arrival rates, real-time to non-real-time request ratios, missed deadline weight values, wait-time bounds on the non-real-time requests, and varying broadcast rates.

The Politics of City Imaging: A Case Study of the MTV Europe Music Awards Edinburgh 03

In November 2003 the city of Edinburgh hosted the MTV Europe Music Awards. This article discusses the event's contribution to Edinburgh's reimaging and local involvement. After outlining links between cultural events and contemporary urban policy, an in-depth case study charts the evolution of the MTV Europe Awards Edinburgh 03 and how it became embroiled in local political realities. The event became politicized because MTV was given £750 thousand public subsidy to part-fund the show's temporary structure and the outside broadcast costs of a simultaneous live concert in Edinburgh's city center Princes Street Gardens. Officials argued that, beyond the local economic benefit—estimated initially at £4 million—this was justified as the event offered extensive local inclusion and unique promotional opportunities that would give the city's conservative image a contemporary edge. They believed Edinburgh's reimaging as an exciting short-break destination would occur because of the association with A-list celebrities and MTV's innovative marketing that connected with the global traveling, yet elusive, "MTV generation." MTV found Edinburgh an ideal city as its experienced events team eased production of their complex "live" television show, while its young people and iconic place features gave the show a distinctive narrative. The article's key finding is that MTV's desire for these place features to reimage their television show meant the event primarily benefited them and the local tourist industry. MTV happily fostered local involvement—creating memorable moments for participants—but their celebrity and place focus meant their voices were often marginalized. This was accentuated because the local newspaper, part of a group often critical of public sector organizers, emphasized: the event's cost and disruption, the inappropriate actions of public officials, and MTV's ticket allocation to corporate clients.

Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking

In this paper, we have proposed a novel concept called Hitch-hiking in order to reduce the energy consumption of broadcast application for wireless networks. Hitch-hiking takes advantage of the physical layer design that facilitates the combining of partial signals to obtain the complete information. The concept of combining partial signals using maximal ratio combiner [J.G. Proakis, 2001] has been used to improve the reliability of the communication channel but has never been exploited to reduce energy consumption. We propose a centralized heuristic algorithm called wireless multicast with Hitch-hiking (WMH) to construct an energy efficient tree using Hitch-hiking and also present a distributed version of the heuristic. We also evaluate the proposed heuristics through simulation. Simulation results show that Hitch-hiking can reduce the transmission cost of broadcast by as much as 50%. Further, we propose and evaluate a protocol called PSBT that reduces energy consumption of broadcast by eliminating redundancy in receive operation. Finally, we propose an algorithm that takes advantage of both Hitch-hiking and PSBT in conserving energy