Dynamic Spectrum Access Decisions. George F. Elmasry
Читать онлайн книгу.
network, assuming unicast transmission?Repeat (a) assuming broadcast transmission where every one‐hop‐away node that receives the packet will have to broadcast the packet in order to make sure it reaches the nodes that are two over‐the‐air hops away.Which method would you recommend for propagating DSA control traffic between nodes: unicast transmission or multicast transmission where the packet makes use of the multiple access capability of the waveform?
3 For the same MANET discussed in Problem 2 above, let us assume that the DSA control traffic packet is divided into smaller frames where over‐the‐air transmission is for one frame not the entire packet. Let us assume that the DSA control traffic packet is divided into 20 frames.Create a table that shows the probability of delivering the DSA control traffic packet with one transmission when the probability of delivering a frame is 1.0, 0.99, 0.98, 0.97, 0.96, and 0.95, respectively. Assume that losing frames are independent events and that you have to receive every frame in the packet to reconstruct the packet accurately. Make other appropriate approximations if needed.Let us consider the MANET case in problem 2 and consider the one over‐the‐air hop away and the two over‐the‐air hops away transmission cases. Let us consider the unicast transmission scenario. Create the same table as in part (a) if we have to use unicast and transmit the packet two over‐the‐air hops away to reach a node two over‐the‐air hops away from the transmitting node. Assume that packet segmentation to frames occurs with every over‐the‐air transmission.
4 Consider Figure 4.6 with a master routing engine, master DSA engine, waveform routing engine, and waveform DSA engine. What is your expectation of reactive routes stability when:master routing engine update time > waveform routing engine update time?master routing engine update time = waveform routing engine update time?master routing engine update time < waveform routing engine update time?
Bibliography
1 Charland, R., Veytser, L., and Cheng, B.‐N., Integrating multiple radio‐to‐router interfaces to open source dynamic routers. In IEEE Military Communications Conference, MILCOM 2012, October 2012.
2 Cheng, J., Wheeler, J., and Veytser, L., Radio‐to‐router interface technology and its applicability at the tactical edge. IEEE Communications Magazine, vol. 50, no. 10, pages 70–77, October 2012.
3 Cheng, B., Charland, R., Christensen, P. et al., Evaluation of multihop airborne IP backbone with heterogeneous radio technologies. IEEE Transactions on Mobile Computing, vol. 13, no 2, February 2013.
4 Cheng, B., Coyle, A., and Wheeler, J., Characterizing routing with radio‐to‐router information in a heterogeneous airborne network. IEEE Transactions on Wireless Communications, vol. 12, issue 8, August 2013.
5 Chowdhury, K. and Akyildiz, I., A routing protocol for cognitive radio ad hoc networks. IEEE Journal on Selected Areas in Communications, vol. 29, no. 4, April 2011.
6 Elmasry, G., Aanderud, B., and Arganbright, T., A distributed multi‐tiered network agent for heterogeneous MANET resource optimization. Proceedings of Milcom 2015.
7 Elmasry, G., Haan, B., and McCabe, R., Augmenting OLSR with a priority aware dynamic routing for hetergeneous netwoking. Proceedings of Milcom 2015.
8 Elmasry, G., Aanderud, B., Kraus, W., and McCabe, R., Software‐defined dynamic power‐control and directional‐reuse protocol for TDMA radios. Proceedings of Milcom 2015.
9 Jawar, I. and Wu, J., Resource Allocation in Wireless Networks Using Directional Antennas. Proceedings of PerCom 2006.
10 Kanzaki, A., Uemukai, T., Hara, T., and Nishio, S., Dynamic TDMA slot assignment in ad hoc networks. In Advanced Information Networking and Applications, March 2003.
11 Patil, V.C., Biradar, R.V., Mudholkar, R.R., and Sawant, S., On‐demand multipath routing protocols for mobile ad hoc networks issues and comparison. International Journal of Wireless Communication and Simulation, vol. 2(1), pp. 21–38, 2010.
12 Pearlman, M., Haas, Z., Sholander, P., and Tabrizi, S.S., Alternative path routing in mobile ad hoc networks. Proceedings of Milcom 2002.
13 Vergados, D.J., Koutsogiannaki, M., Vergados, D.D., and Loumos, V., Enhanced end‐to‐end TDMA for wireless ad‐hoc networks. IEEE Communications Conference, Computers and Communications, July 2007.
14 Wang, J., Kong, L., and Wu, M.‐Y., Capacity of wireless ad hoc networks using practical directional antennas. Proceedings of WCNC 2010, pp. 1–6.
15 Young, C.D., USAP: a unifying dynamic distributed multichannel TDMA slot assignment protocol. IEEE Military Communications Conference, MILCOM 1996, October 1996.
16 Zhang, J. and Liew, S.C., Capacity improvement of wireless ad hoc networks with directional antennae. SIGMOBILE Mobile Computing and Communications Review, vol. 10, no. 4, pp. 17–19, October 2006.
17 https://tools.ietf.org/html/draft-ietf-manet-dlep-02 .
18 https://tools.ietf.org/id/draft-dubois-r2cp-00.txt.
19 https://tools.ietf.org/id/draft-ietf-manet-dlep-16.txt .
20 https://tools.ietf.org/rfc/rfc5578.txt .
Notes
1 1 Another case for using the simple ROC model is with MANET spatial frequency reuse. The spectrum sensor is sensing (probing) a frequency used by a peer node and the goal of spectrum fusion is to decide if the frequency can be spatially reused or not at a given geolocation and time without interfering with the other peer node.
2 2 Similar to all aspects of network design, DSA design will require simulation environment and laboratory testing during the system design and evaluation phases and before deployment. Hidden nodes can be simulated in scripted scenarios to evaluate the performance of this trade space
3 3 In Figure 4.2, for the same‐channel in‐band sensing case, noise and interfering signal are combined as noise.
4 4 This can occur in sensor networks where the node has SWaP limitations.
5 20 Notice in Figure 4.2 that RSSI is a single‐dimension positive value. The figure shows three different scenarios of RSSI reading and the vertical line is meant to show the decision threshold not a vertical axis.
6 5 Some reference terminology is that a node has a single cognitive engine that contains multiple cognitive processes. Some other reference terminology is that a node has multiple cognitive engines. Regardless of using either terminology, a cognitive DSA engine/process has to work with other cognitive engines/processes.
7 6 This example makes a good case for developing DSA as a set of cloud services as further discussed in the second part of the book. One can see how in this example the routing engine is requesting a service (to establish a link) and the DSA engine is replying to the service request.
8 7 There are different propagation models the DSA engine can use, including a standard Gaussian model, a modified Gaussian model, a Lorentzian model or a modified Lorentzian model.
9 8 In heterogeneous hierarchical MANET, one can create two tears of routing: local routing within a network and global routing between networks.
10 9 A flow can be dictated by source and destination address, and type‐of‐service (TOS), with the lowest amount of data rate allocation common between all waveforms.
11 10 One possible change that must not be ignored and needs to be considered first