期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Analysis of Cognitive Radio Enabled Flooding in Opportunistic Networks
1
作者 muhammad arshad islam Marcel Waldvogel 《International Journal of Communications, Network and System Sciences》 2014年第7期212-222,共11页
Epidemic routing (Flooding) is considered as a simple routing protocol for opportunistic networks where the participants attempt to transmit whatever information they have to everyone who does not already have that in... Epidemic routing (Flooding) is considered as a simple routing protocol for opportunistic networks where the participants attempt to transmit whatever information they have to everyone who does not already have that information. However, it is plagued with disadvantages of resource scarcity as it exerts stress on available bandwidth as well as storage capacity of the devices in the network. Cognitive radio (CR) is one of the emerging technologies that can improve the bandwidth utilization by smart allocation of spectrum radio bands. Ideally speaking, a spectrum-aware cognitive radio is able to sense the local spectrum usage and adapt its own radio parameters accordingly. In this study, we have performed experiments to analyze the gains achieved by flooding protocol using cognitive radios of varying capabilities in opportunistic networks. We have performed experiments on three opportunistic networks obtained from real-life traces from different environments and presented results showing variance in delivery efficiency as well as cost incurred on those scenarios. Our results show that performance of flooding can be significantly improved using CRs in bandwidth-scarce environments;however, the improvement is not uniform with the increase in a number of available bands. 展开更多
关键词 OPPORTUNISTIC NETWORKS Delay TOLERANT NETWORKS FLOODING COGNITIVE Radio Simulation
下载PDF
Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow
2
作者 muhammad arshad islam Marcel Waldvogel 《Wireless Engineering and Technology》 2012年第3期132-141,共10页
Most of the existing opportunistic network routing protocols are based on some type of utility function that is directly or indirectly dependent on the past behavior of devices. The past behavior or history of a devic... Most of the existing opportunistic network routing protocols are based on some type of utility function that is directly or indirectly dependent on the past behavior of devices. The past behavior or history of a device is usually referred to as contacts that the device had in the past. Whatever may be the metric of history, most of these routing protocols work on the realistic premise that node mobility is not truly random. In contrast, there are several oracles based methods where such oracles assist these methods to gain access to information that is unrealistic in the real world. Although, such oracles are unrealistic, they can help to understand the nature and behavior of underlying networks. In this paper, we have analyzed the gap between these two extremes. We have performed max-flow computations on three different opportunistic networks and then compared the results by performing max-flow computations on history generated by the respective networks. We have found that the correctness of the history based prediction of history is dependent on the dense nature of the underlying network. Moreover, the history based prediction can deliver correct paths but cannot guarantee their absolute reliability. 展开更多
关键词 OPPORTUNISTIC NETWORKS Delay TOLERANT NETWORKS ROUTING Protocols Max-Flow Simulation Modified Dijk-Stra Algorithm
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部