Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-9q27g Total loading time: 0 Render date: 2024-07-18T10:40:29.784Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  05 March 2015

Lingyang Song
Affiliation:
Peking University, Beijing
Dusit Niyato
Affiliation:
Nanyang Technological University, Singapore
Zhu Han
Affiliation:
University of Houston
Ekram Hossain
Affiliation:
University of Manitoba, Canada
Get access
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2015

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] K., Doppler, M., Rinne, C., Wijting, C., Ribeiro, and K., Hugl, “Device-to-device communication as an underlay to LTE-advanced networks,”IEEE Commun. Mag., vol. 47, no. 12, pp. 42–49, Dec. 2009.Google Scholar
[2] S., Basagni, M., Conti, S., Giordano, and I., Stojmenovic, Mobile Ad Hoc Networking. Wiley-IEEE Press, 2004.Google Scholar
[3] C.-H., Yu, O., Tirkkonen, K., Doppler, and C., Ribeiro, “On the performance of device-to-device underlay communication with simple power control,” in Proc. IEEE Vehicular Technology Conference 2009 – Spring, Barcelona, Apr. 2009.Google Scholar
[4] T., Koskela, S., Hakola, T., Chen, and J., Lehtomaki, “Clustering concept using device-to-device communication in cellular system,” in Proc. IEEE Wireless Communications and Networking Conference, Sydney, Apr. 2010.Google Scholar
[5] K., Doppler, M., Rinne, P., Janis, C., Ribeiro, and K., Hugl, “Device-to-device communications; functional prospects for LTE-advanced networks,” in Proc. IEEE International Conference on Communications Workshops, Dresden, Jun. 2009.Google Scholar
[6] K., Doppler, C.-H., Yu, C., Ribeiro, and P., Janis, “Mode selection for device-to-device communication underlaying an LTE-advanced network,” in Proc. IEEE Wireless Communications and Networking Conference, Sydney, Apr. 2010.Google Scholar
[7] H., Min, W., Seo, J., Lee, S., Park, and D., Hong, “Reliability improvement using receive mode selection in the device-to-device uplink period underlaying cellular networks,”IEEE Trans. Wireless Commun., vol. 10, no. 2, pp. 413–418, Feb. 2011.Google Scholar
[8] S., Hakola, C., Tao, J., Lehtomaki, and T., Koskela, “Device-to-device (D2D) communication in cellular network – performance analysis of optimum and practical communication mode selection,” in Proc. IEEE Wireless Communications and Networking Conference, Sydney, Apr. 2010.Google Scholar
[9] C.-H., Yu, K., Doppler, C., Ribeiro, and O., Tirkkonen, “Performance impact of fading interference to device-to-device communication underlaying cellular networks,” in IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications, Tokyo, Sept. 2009, pp. 858–862.Google Scholar
[10] C.-H., Yu, O., Tirkkonen, K., Doppler, and C., Ribeiro, “Power optimization of device-to-device communication underlaying cellular communication,” in Proc. International Conference on Communications, Dresden, Jun. 2009.Google Scholar
[11] H., Xing and S., Hakola, “The investigation of power control schemes for a device-to-device communication integrated into OFDMA cellular system,”in Proc. IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), Istanbul, Sept. 2010, pp. 17751780.Google Scholar
[12] P., Janis, V., Koivunen, C., Ribeiro, K., Doppler, and K., Hugl, “Interference-avoiding MIMO schemes for device-to-device radio underlaying cellular networks,” in Proc. IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications, Tokyo, Sept. 2009, pp. 2385–2389.Google Scholar
[13] T., Peng, Q., Lu, H., Wang, S., Xu, and W., Wang, “Interference avoidance mechanisms in the hybrid cellular and device-to-device systems,” in Proc. IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications, Tokyo, Sept. 2009, pp. 617–621.Google Scholar
[14] P., Janis, V., Koivunen, C., Ribeiro et al., “Interference-aware resource allocation for device-to-device radio underlaying cellular networks,” in Proc. IEEE Vehicular Technology Conference 2009 – Spring, Barcelona, Apr. 2009.Google Scholar
[15] M., Zulhasnine, C., Huang, and A., Srinivasan, “Efficient resource allocation for device-to-device communication underlaying LTE network,” in Proc. IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications, Niagara Falls, Oct. 2010, pp. 368–375.Google Scholar
[16] S., Xu, H., Wang, T., Chen, Q., Huang, and T., Peng, “Effective interference cancellation scheme for device-to-device communication underlaying cellular networks,” in Proc. IEEE Vehicular Technology Conference 2010 – Fall, Ottawa, Sept. 2010.Google Scholar
[17] C.-H., Yu, K., Doppler, C., Ribeiro, and O., Tirkkonen, “Resource sharing optimization for D2D communication underlaying cellular networks,”IEEE Trans. Wireless Commun., vol. 10, no. 8, pp. 2752–2763, Aug. 2011.Google Scholar
[18] WINNER II D1.1.2, “WINNER II channel models,” https://www.istwinner.org/deliverables.html, Sept. 2007.
[19] 3GPP, Technical Report TS 36.213 V8.2.0, “E-UTRA physical layer procedures.”
[20] S., Boyd and L., Vandenberghe, Eds., Convex Optimization. Cambridge University Press, 2004, http://www.stanford.edu/∼boyd/cvxbook.html.
[21] M. K., Wood and G. B., Dantzig, “Programming of interdependent activities. I. general discussion,”Econometrica, vol. 17, pp. 193–199, 1949.Google Scholar
[22] G. B., Dantzig, “Programming of interdependent activities. II. Mathematical model,”Econometrica, vol. 17, pp. 200–211, 1949.Google Scholar
[23] L. G., Khachian, “A polynomial algorithm in linear programming,”Dokl. Akad. Nauk SSSR, English translation in Soviet Math. Dokl., vol. 244, pp. 1093–1096, 1979.Google Scholar
[24] N., Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica, vol. 4, pp. 373–395, 1984.Google Scholar
[25] E., Wallace, “Altruism helps swarming robots fly better,”Genevalunch News, May 2011. http://genevalunch.com/2011/05/04/altruism-helps-swarming-robots-fly-better-study-shows/.
[26] M., Waibel, D., Floreano, and L., Keller, “A quantitative test of Hamilton's rule for the evolution of altruism,”PLOS Biol., vol. 9, no. 5, p. e1000615, May 2011.Google Scholar
[27] T. S. Marco, Dorigo, Ant Colony Optimization. MIT Press, 2004.Google Scholar
[28] P., Rabanal, I., Rodrguez, and F., Rubio, Ant Colony Optimization and Swarm Intelligence. Springer, 2008, ch. Finding minimum spanning/distances trees by using river formation dynamics, pp. 60–71.Google Scholar
[29] D., Karaboga, “Artificial bee colony algorithm,”Scholarpedia, vol. 5, no. 3, p. 6915, 2010.Google Scholar
[30] U., Aickelin and D., Dasgupta, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, 2006, ch. Artificial immune systems.Google Scholar
[31] E., Rashedi, H., Nezamabadi-pour, and S., Saryazdi, “GSA: A gravitational search algorithm,”Science Direct, vol. 179, no. 13, pp. 2232–2248, Jun. 2009.Google Scholar
[32] H., Nobahari, M., Nikusokhan, and P., Siarry, “Non-dominated sorting gravitational search algorithm,” in International Conference on Swarm Intelligence, ICSI, Cergy, Jun. 2011.Google Scholar
[33] K. N., Krishnanand and D., Ghose, Swarm Intelligence. Springer, 2009, ch. Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions, pp. 87–124.Google Scholar
[34] K., Krishnanand and D., Ghose, “Glowworm swarm based optimization algorithm for multimodal functions with collective robotics applications,”Multiagent and Grid Systems, vol. 2, no. 3, pp. 209–222, 2006.Google Scholar
[35] H., Shah-Hosseini, “The intelligent water drops algorithm: A nature-inspired swarm-based optimization algorithm,”Int. J. Bio-Inspired Computation, vol. 1, no. 1/2, pp. 71–79, 2009.Google Scholar
[36] K. E., Parsopoulos and M. N., Vrahatis, “Recent approaches to global optimization problems through particle swarm optimization,”Natural Computing, vol. 1, no. 2–3, pp. 235–306, 2002.Google Scholar
[37] M., Clerc, Particle Swarm Optimization. Wiley, 2006.Google Scholar
[38] M. M., al Rifaie, M. J., Bishop, and T., Blackwell, “An investigation into the merger of stochastic diffusion search and particle swarm optimisation,” in Proc. 13th Conference on Genetic and Evolutionary Computation, (GECCO), Dublin, Jun. 2011, pp. 37–44.Google Scholar
[39] P., Rabanal, I., Rodríguez, and F., Rubio, Unconventional Computation. Springer, 2007, ch. Using river formation dynamics to design heuristic algorithms, pp. 163–177.Google Scholar
[40] P., Rabanal, I., Rodríguez, and F., Rubio, Nature-Inspired Algorithms for Optimisation. Springer, 2009, ch. Applying river formation dynamics to solve NP-complete problems, pp. 333–368.Google Scholar
[41] P., Rabanal, I., Rodríguez, and F., Rubio, “Testing restorable systems: Formal definition and heuristic solution based on river formation dynamics,”Formal Aspects of Computing, vol. 25, no. 5, pp. 743–768, 2013.Google Scholar
[42] A., Czirk and T., Vicsek, “Collective behavior of interacting self-propelled particles,”Physica A: Statist. Mech. Appl., vol. 281, no. 1–4, pp. 17–29, 2000.Google Scholar
[43] E., Bertin, M., Droz, and G., Grégoire, “Hydrodynamic equations for self-propelled particles: Microscopic derivation and stability analysis,”Physics A: Math. Theor., vol. 42, p. 445001, 2009.Google Scholar
[44] Y.-X., Li, R., Lukeman, and L., Edelstein-Keshet, “Minimal mechanisms for school formation in self-propelled particles,”Physica D: Nonlinear Phenomena, vol. 237, no. 5, pp. 699–720, 2008.Google Scholar
[45] S. J., Nasuto, M. J., Bishop, and S., Lauria, “Time complexity analysis of the stochastic diffusion search,” in Proc. Neural Computation, Vienna, Sept. 1998, pp. 260–266.Google Scholar
[46] D., Myatt, J., Bishop, and S., Nasuto, “Minimum stable convergence criteria for stochastic diffusion search,”Electron. Lett., vol. 40, no. 2, pp. 112–113, 2004.Google Scholar
[47] M. M., al Rifaie, J. M., Bishop, and T., Blackwell, “Information sharing impact of stochastic diffusion search on differential evolution algorithm,”Memetic Computing, vol. 4, no. 4, pp. 327–338, 2012.Google Scholar
[48] M., al Rifaie and A., Aber, “Identifying metastasis in bone scans with stochastic diffusion search,” in Information Technology in Medicine and Education (ITME), Hokodate, Hokkaido, Aug. 2012, pp. 519–523.Google Scholar
[49] M., al Rifaie, A., Aber, and A., Oudah, “Utilising stochastic diffusion search to identify metastasis in bone scans and microcalcifications on mammographs,” in Bioinformatics and Biomedicine Workshops (BIBMW), Philadelphia, PA, Oct. 2012, pp. 280–287.Google Scholar
[50] C., Li and S., Yang, “Fast multi-swarm optimization for dynamic optimization problems,” in Fourth International Conference on Natural Computation, ICNC, Jinan, Oct. 2008, pp. 624–628.Google Scholar
[51] J., McCaffrey, “Test run - multi-swarm optimization,”MSDN Mag., Sept. 2013.Google Scholar
[52] M. W., Cooper and K., Farhangian, “Multicriteria optimization for nonlinear integer-variable problems,”Large Scale Systems, vol. 9, pp. 73–78, 1985.Google Scholar
[53] S., Martello and P., Toth, Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, 1990.Google Scholar
[54] M. L., Fisher, “The Lagrangian method for solving integer programming problems,”Management Sci., vol. 27, pp. 1–18, 1981.Google Scholar
[55] M., Guignard and S., Kim, “Lagrangian decomposition: A model yielding stronger Lagrangian bounds,”Math. Programming, vol. 39, pp. 215–228, 1987.Google Scholar
[56] J. F., Benders, “Partitioning procedures for solving mixed-variables programming problems,”Numerische Math., vol. 4, pp. 238–252, 1962.Google Scholar
[57] H., Weyl, “Elementare Theorie der konvexen Polyeder,”Commentarii Math. Helv., 1935, vol. 7, pp. 290–306 [English translation “The elementary theory of convex polyhedra,” in H. W., Kuhn and A. W., Tucker, Contributions to the Theory of Games, “Elementare Theorie der konvexen Polyeder,” vol. 1, p. 3, 1950].Google Scholar
[58] R. E., Gomory, “Outline of an algorithm for integer solution to linear programs,”Bull. Am. Math. Soc., vol. 64, no. 5, pp. 275–278, 1958.Google Scholar
[59] D. P., Bertsekas, Dynamic Programming and Optimal Control. Athena Scientific, 1995.Google Scholar
[60] R. V., Slyke and R. J., Wets, “L-shaped linear program with application to optimal control and stochastic linear programming,”SIAM J. Appl. Math., vol. 17, pp. 638–663, 1969.Google Scholar
[61] W. P., Ziemer, Weakly Differentiable Functions: Sobolev Spaces and Functions of Bounded Variation. Springer, 1989.Google Scholar
[62] S., Kullback, “The Kullback–Leibler distance,”Am. Statistician, vol. 41, no. 4, pp. 340–341, 1987.Google Scholar
[63] S., Kullback, Information Theory and Statistics. Dover, 1997.Google Scholar
[64] D., Hosmer and S., Lemeshow, Applied Logistic Regression. Wiley-Interscience, 2000.Google Scholar
[65] J., Duchi, S. Shalev-Shwartz, Y., Singer, and T., Chandra, “Efficient projections onto the ℓ1-ball for learning in high dimensions,” in Proc. 25th International Conference on Machine Learning. ACM, pp. 272–279.
[66] A., Quattoni, X., Carreras, M., Collins, and T., Darrell, “An efficient projection for ℓ1,∞ regularization,” in Proc. 26th Annual International Conference on Machine Learning, ICML ’09. ACM, pp. 857–864.
[67] J., Liu and J., Ye, “Efficient Euclidean projections in linear time,” in Proc. 26th Annual International Conference on Machine Learning, ICML ’09. ACM, pp. 657–664.
[68] E. van den, Berg and M., Friedlander, “Probing the Pareto frontier for basis pursuit solutions,”SIAM J. Scient. Computing, vol. 31, no. 2, pp. 890–912, 2008.Google Scholar
[69] E. van den, Berg, M., Schmidt, M., Friedlander, and K., Murphy, “Group sparsity via linear-time projection,”Optimization Online, 2008.Google Scholar
[70] Z., Han, H., Li, and W., Yin, Compressive Sensing for Wireless Networks. Cambridge University Press, 2012.Google Scholar
[71] D., Fudenberg and J., Tirole, Game Theory. MIT Press, 1991.Google Scholar
[72] G., Owen, Game Theory, 3rd edn. Academic Press, 2001.Google Scholar
[73] V., Krishna, Auction Theory. Academic Press, 2002.Google Scholar
[74] http://www.gametheory.net
[75] C. U., Saraydar, N. B., Mandayam, and D. J., Goodman, “Efficient power control via pricing in wireless data networks,”Bull. Am. Math. Soc., vol. 50, no. 2, pp. 291–303, Feb. 2002.Google Scholar
[76] H., Yaiche, R. R., Mazumdar, and C., Rosenberg, “A game theoretic framework for bandwidth allocation and pricing in broadband networks,”IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 667–678, Oct. 2000.Google Scholar
[77] Z., Han, Z., Ji, and K. J. R., Liu, “Power minimization for multi-cell OFDM networks using distributed non-cooperative game approach,” in IEEE Global Telecommunications Conference, Dallas, TX, Nov.–Dec. 2004, pp. 3742–3747.Google Scholar
[78] Z., Han, Z., Li, and K. J. R., Liu, “A referee-based distributed scheme of resource competition game in multi-cell multi-user OFDMA networks,”IEEE J. Selected Areas Commun., Special Issue on Non-cooperative Behavior in Networking, vol. 25, no. 6, pp. 1079–1090, Aug. 2007.Google Scholar
[79] V., Srinivasan, P., Nuggehalli, C. F., Chiasserini, and R. R., Rao, “Cooperation in wireless ad hoc networks,” in Proc. IEEE Conference on Computer Communications (INFOCOM 2003), San Francisco, CA, Mar. 2003.Google Scholar
[80] E., Altman, A. A., Kherani, P., Michiardi, and R., Molva, “Non-cooperative forwarding in ad-hoc networks,”INRIA, Technical Report, May 2005.
[81] R. H., Porter, “Optimal cartel trigger price strategies,”J. Economic Theory, vol. 29, pp. 313–318, Apr. 1983.Google Scholar
[82] N., Vieille, “Stochastic games: Recent results,” in Handbook of Game Theory. Elsevier Science, pp. 1833–1850, 2002.Google Scholar
[83] L., Shapley, “Stochastic games,”Proc. Nat. Acad. Sci. USA, vol. 39, pp. 1095–1100, 1953.Google Scholar
[84] A., Neyman, Stochastic Games and Applications. Springer, 2003.Google Scholar
[85] J., Filar and K., Vrieze, Competitive Markov Decision Processes. Springer, 1996.Google Scholar
[86] E., Altman, Advances in Dynamic Games. Birkhäuser, 2005, vol. 7, ch. Applications of dynamic games in queues, pp. 309–342.Google Scholar
[87] E., Altman, T., Jimenez, R. N., Queija, and U., Yechiali, “Optimal routing among./m/1 queues with partial information,”INRIA, Technical Report, 2004.
[88] W. van den, Broek, J., Engwerda, and J., Schumachar, “Robust equilibria in indefinite linear-quadratic differential games,”J. Optimization Theory Appl., vol. 119, no. 3, pp. 565–595, 2003.Google Scholar
[89] T., Basar and G. J., Olsder, Dynamic Noncooperative Game Theory, 2nd edn. Academic Press, 1995.Google Scholar
[90] T., Basar and P., Bernhard, H8-Optimal Control and Related Minimax Design Problems: A Dynamic Game Approach. Birkhäuser, 1995.Google Scholar
[91] M. G., Crandall and P.-L., Lions, “Viscosity solutions of Hamilton–Jacobi equations,”Trans. Am. Math. Soc., vol. 277, no. 1, pp. 1–42, 1983.Google Scholar
[92] A. D., Polyanin and F. Z., Valentin, Handbook of Nonlinear Partial Differential Equations. Chapman and Hall/CRC, 2003.Google Scholar
[93] W., Fleming and P., Souganidis, “On the existence of value functions of two-player, zero-sum stochastic differential games,”Indiana Univ. Math. J., vol. 38, no. 2, pp. 293–314, 1989.Google Scholar
[94] D., Grosu, A. T., Chronopoulos, and M., Leung, “Load balancing in distributed systems: An approach using cooperative games,” in Proc. IPDPS, Fort Lauderdale, FL, Apr. 2002, pp. 52–61.Google Scholar
[95] W., Rhee and J. M., Cioffi, “Increase in capacity of multiuser OFDM system using dynamic subchannel allocation,” in Proc. IEEE Vehicular Technology Conf. (VTC 2000 Spring), Tokyo, May 2000, pp. 1085–1089.Google Scholar
[96] Z., Han, Z., Ji, and K. J. R., Liu, “Fair multiuser channel allocation for OFDMA networks using Nash bargaining and coalitions,”IEEE Trans. Commun., vol. 53, no. 8, pp. 1366–1376, Aug. 2005.Google Scholar
[97] C., Peng, H., Zheng, and B. Y., Zhao, “Utilization and fairness in spectrum assignment for opportunistic spectrum access,”Mobile Networks Appl., vol. 11, no. 4, pp. 555–576, Aug. 2006.Google Scholar
[98] J. E., Suris, L., DaSilva, Z., Han, and A., MacKenzie, “Cooperative game theory approach for distributed spectrum sharing,” in IEEE International Conference on Communications, ICC, Glasgow, Jun. 2007, pp. 5282–5287.Google Scholar
[99] K., Lee and V., Leung, “Fair allocation of subcarrier and power in an OFDMA wireless mesh network,”IEEE J. Selected Areas Commun., vol. 24, no. 11, pp. 2051–2060, Nov. 2006.Google Scholar
[100] H., Park and M. van der, Schaar, “Bargaining strategies for networked multimedia resource management,”IEEE Trans. Signal Process., vol. 55, no. 7, pp. 3496–3511, Jul. 2007.Google Scholar
[101] K., Apt and A., Witzel, “A generic approach to coalition formation,” in Proc. International Workshop on Computational Social Choice (COMSOC), Amsterdam, Dec. 2006.Google Scholar
[102] K., Apt and A., Witzel, “A generic approach to coalition formation,” arXiv:0709. 0435[cs.GT], Sept. 2007.
[103] K., Apt and T., Radzik, “Stable partitions in coalitional game,” arXiv:cs/0605132[cs.GT], May 2006.
[104] D. T., Mortensen, The Matching Process as a Non-Cooperative/Bargaining Game. John McCall, 1982.Google Scholar
[105] A. E., Roth and E., Peranson, “The redesign of the matching market for American physicians: Some engineering aspects of economic design,”Am. Economic Rev., vol. 89, no. 4, pp. 748–780, Sept. 1999.Google Scholar
[106] D. M., Gusfield and R. W., Irving, The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989.Google Scholar
[107] Wikipedia, “Stable marriage problem,” 2013. http://en.wikipedia.org/wiki/Stable_marriage_problem.
[108] D., Gale and L. S., Shapley, “College admissions and the stability of marriage,”Am. Math. Monthly, vol. 69, no. 1, pp. 9–15, Jan. 1962.Google Scholar
[109] S., Bayat, R. H. Y., Louie, Z., Han, Y., Li, and B., Vucetic, “Distributed stable matching algorithm for physical layer security with multiple source-destination pairs and jammer nodes,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), Paris, Apr. 2012.Google Scholar
[110] S., Bayat, R. H. Y., Louie, Z., Han, B., Vucetic, and Y., Li, “Physical-layer security in distributed wireless networks using matching theory,”IEEE Trans. Information Forensics Security, vol. 8, no. 5, pp. 717–732, May 2013.Google Scholar
[111] Annual Averages of Employed Multiple Job Holders by Industry. US Bureau of Labor Statistics, 2002.
[112] J., Green and J. J., Laffont, “On coalition incentive compatibility,”Rev. Economic Studies, vol. 46, no. 2, pp. 243–254, Apr. 1979.Google Scholar
[113] T., Groves, “Incentives in teams,”Econometrica, vol. 45, pp. 617–631, 1973.Google Scholar
[114] A., Gibbard, “Manipulation of voting schemes: A general result,”Econometrica, vol. 41, no. 4, pp. 587–601, 1973.Google Scholar
[115] M. A., Satterthwaite, “Strategy-proofness and arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions,”J. Economic Theory, vol. 10, pp. 187–217, Apr. 1975.Google Scholar
[116] L., Hurwicz, Decision and Organization: On Informationally Decentralized Systems, 2nd edn. University of Minnesota Press, 1972.Google Scholar
[117] R. B., Myerson and M. A., Satterthwaite, “Efficient mechanisms for bilateral trading,”J. Economic Theory, vol. 29, pp. 265–281, 1983.Google Scholar
[118] K. J., Arrow, Economics and Human Welfare: The Property Rights Doctrine and Demand Revelation under Incomplete Information. Academic Press, 1979.Google Scholar
[119] C., d'Aspremont and L., Gerard-Varet, “Incentives and incomplete information,”J. Public Economics, vol. 29, no. 45, pp. 11–25, 1979.Google Scholar
[120] V., Krishna, Auction Theory, 2nd edn. Academic Press: San Diego, CA, 2010.Google Scholar
[121] R., Wilson, “Auctions of shares,”Q. J. Economics, vol. 93, pp. 675–698, 1979.Google Scholar
[122] L., Ausubel and P., Cramton, “Demand reduction and inefficiency in multi-unit auctions,”University of Maryland, Technical Report, 1998, http://www.cramton.umd.edu/papers1995-1999/98wp-demand-reduction.pdf.
[123] C., Maxwell, “Auctioning divisible commodities: A study of price determination,”Harvard University, Technical Report, 1983.
[124] K., Back and J. F., Zender, “Auctions of divisible goods: On the rationale for the treasury experiment,”Rev. Financial Studies, vol. 6, pp. 733–764, 1993.Google Scholar
[125] J. J. D., Wang and J. F., Zender, “Auctioning divisible goods,”Economic Theory, no. 19, pp. 673–705, 2002.Google Scholar
[126] A., Hortacsu, “Mechanism choice and strategic bidding in divisible good auctions: An empirical analysis of the Turkish treasury auction market,”Stanford University, Technical Report, 2000, http://home.uchicago.edu/∼hortacsu/ttreas.pdf.
[127] K. J., Sunnevag, “Auction design for the allocation of emission permits,” Technical Report, University of California at Santa Barbara, 2001.
[128] G., Federico and D., Rahman, “Bidding in an electricity pay-as-bid auction,”J. Regulatory Economics, vol. 24, no. 2, pp. 175–211, 2003.Google Scholar
[129] R., Johari and J. N., Tsitsiklis, “Efficiency loss in a network resource allocation game,”Math. Operations Res., vol. 29, no. 3, pp. 407–435, Aug. 2004.Google Scholar
[130] S., Yang and B., Hajek, “Revenue and stability of a mechanism for efficient allocation of a divisible good,” Technical Report, Department of Electrical and Computer Engineering, University of Illinois at Urbana–Champaign.
[131] R., Maheswaran and T., Başar, “Nash equilibrium and decentralized negotiation in auctioning divisible resources,”Group Decision and Negotiation, vol. 12, no. 5, pp. 361–395, 2003.Google Scholar
[132] R. T., Maheswaran and T., Başsar, “Coalition formation in proportionally fair divisible auctions,” in AAMAS ’03 Proc. Second International Conference on Autonomous Agents and Multi-Agent Systems, 2003, pp. 25–32.Google Scholar
[133] R. T., Maheswaran and T., Başsar, “Decentralized network resource allocation as a repeated noncooperative market game,” in Proc. 40th IEEE Conference on Decision and Control (CDC 2001), Orlando, FL, Dec. 2001, pp. 4565–4570.Google Scholar
[134] P., Milgrom, Putting Auction Theory to Work. Cambridge University Press, 2004.Google Scholar
[135] D., Friedman, D. P., Friedman, and J., Rust, The Double Auction Market: Institutions, Theories, and Evidence. Westview Press, 1993.Google Scholar
[136] “Contract theory.” http://en.wikipedia.org/wiki/Contract_theory.
[137] L., Gao, X., Wang, Y., Xu, and Q., Zhang, “Spectrum trading in cognitive radio networks: A contract-theoretic modeling approach,”IEEE J. Selected Areas Commun., vol. 29, no. 4, pp. 843–855, Apr. 2011.Google Scholar
[138] L., Gao, J., Huang, Y., Chen, and B., Shou, “Contrauction: An integrated contract and auction design for dynamic spectrum sharing,” in 46th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, Mar. 2012.Google Scholar
[139] L., Gao, J., Huang, Y., Chen, and B., Shou, “An integrated contract and auction design for secondary spectrum trading,”IEEE J. Selected Areas Commun., vol. 31, no. 3, pp. 581–592, Mar. 2013.Google Scholar
[140] P., Bolton and M., Dewatripont, Contract Theory. MIT Press, 2004.Google Scholar
[141] D. M., Kreps and R., Wilson, “Sequential equilibria,”Econometrica, vol. 50, no. 4, pp. 863–894, 1982.Google Scholar
[142] D., Monderer and L. S., Shapley, “Potential games,”Games and Economic Behavior, vol. 14, no. 1, pp. 124–143, 1996.Google Scholar
[143] A., MacKenzie and L., DaSilva, Game Theory for Wireless Engineers. Morgan & Claypool Publishers, 2006.Google Scholar
[144] G., Scutari, S., Barbarossa, and D. P., Palomar, “Potential games: A framework for vector power control problems with coupled constraints,” in IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, vol. 4, Toulouse, May 2006, p. IV.Google Scholar
[145] J., Neel, J., Reed, and R., Gilles, “Game models for cognitive radio analysis,” in SDR Forum Technical Conference, vol. 4, Phoenix, AZ, Nov. 2004.Google Scholar
[146] J., Neel, J., Reed, and R., Gilles, “Convergence of cognitive radio networks,” in Wireless Communications and Networking Conference, vol. 4, Atlanta, GA, Mar. 2004, pp. 2250–2255.Google Scholar
[147] J., Neel, J., Reed, and R., Gilles, “The role of game theory in the analysis of software radio networks,” in SDR Forum Technical Conference, San Diego, CA, Nov. 2002.Google Scholar
[148] A., Fattahi and F., Paganini, “New economic perspectives for resource allocation in wireless networks,” in American Control Conference, Portland, OR, Jun. 2005.Google Scholar
[149] E., Altman and Z., Altman, “S-modular games and power control in wireless networks,”IEEE Trans. Automatic Control, vol. 48, pp. 839–842, May 2003.Google Scholar
[150] G., Scutari, S., Barbarossa, and D. P., Palomar, “Potential games: A framework for vector power control problems with coupled constraints,” in ICASSP, May 2006, pp. 241–244.Google Scholar
[151] R., Menon, A., MacKenzie, R., Buehrer, and J., Reed, “Game theory and interference avoidance in decentralized networks,” in SDR Forum Technical Conference, Phoenix, AZ, Nov. 2004.Google Scholar
[152] J., Hicks, A., MacKenzie, J., Neel, and J., Reed, “A game theory perspective on interference avoidance,” in Globecom, vol. 1, Dallas, TX, Nov.–Dec. 2004, pp. 257–261.Google Scholar
[153] J., Hicks and A. B., MacKenzie, “A convergence result for potential games,” in 11th International Symposium on Dynamic Games and Applications, Tucson, AZ, Dec. 2004.Google Scholar
[154] R. J., Aumann, “Subjectivity and correlation in randomized strategy,”J. Math. Economics, vol. 1, no. 1, pp. 67–96, 1974.Google Scholar
[155] R. J., Aumann, “Correlated equilibrium as an expression of Bayesian rationality,”Econometrica, vol. 55, no. 1, pp. 1–18, Jan. 1987.Google Scholar
[156] S., Hart and A., Mas-Colell, “A simple adaptive procedure leading to correlated equilibrium,”Econometrica, vol. 68, no. 5, pp. 1127–1150, Sept. 2000.Google Scholar
[157] S. M., Perlaza, H., Tembine, S., Lasaulce, and M., Debbah, “Satisfaction equilibrium: A general framework for qos provisioning in self-configuring networks,” in GLOBECOM, Miami, FL, Dec. 2010, pp. 1–5.Google Scholar
[158] S. M., Perlaza, H., Tembine, S., Lasaulce, and M., Debbah, “Quality of service provisioning in decentralized networks: A satisfaction equilibrium approach,”IEEE J. Selected Topics Signal Process., vol. 6, no. 2, pp. 104–116, Feb. 2012.Google Scholar
[159] L., Rose, S. M., Perlaza, C. L., Martret, and M., Debbah, “Achieving Pareto optimal equilibria in energy efficient clustered ad hoc networks,” in Proc. IEEE International Conference on Communications (ICC), Budapest, Jun. 2013, pp. 1491–1495.Google Scholar
[160] S., Perlaza, H., Poor, and Z., Han, “Learning efficient satisfaction equilibria via trial and error,” in Proc. Asilomar Conference on Signals, Systems and Computers (ASILOMAR), Pacific Grove, CA, Nov. 2012, pp. 676–680.Google Scholar
[161] M., Belleschi, G., Fodor, and A., Abrardo, “Performance analysis of a distributed resource allocation scheme for D2D communications,” in Proc. IEEE Workshop on Machine-to-Machine Communications, Dec. 2011, pp. 358–362.Google Scholar
[162] N. S., Networks, “The advanced LTE toolbox for more efficient delivery of better user experience,” Nokia Siemens Networks, Technical Report, 2011.
[163] S., Parkvall, A., Furuskar, Y., Jading et al., “LTE-advanced – evolving LTE towards IMT-advanced,” in Proc. VTC2008 – Fall, Sept. 2008, pp. 1–5.Google Scholar
[164] S., Abeta, “Toward LTE commercial launch and future plan for LTE enhancements (LTE-advanced),” in Proc. IEEE International Conference on Communication Systems (ICCS), Nov. 2010, pp. 146–150.Google Scholar
[165] K., Doppler, M., Rinne, C., Wijting, C., Ribeiro, and K., Hugl, “Device-to-device communication as an underlay to LTE-advanced networks,”IEEE Commun. Mag., vol. 47, no. 12, pp. 42–49, Dec. 2009.Google Scholar
[166] K., Doppler, M., Rinne, C., Wijting, C., Ribeiro, and K., Hugl, “Device-to-device communications: Functional prospects for LTE-advanced networks,” in Proc. IEEE International Communications (ICC) Workshops, Jun. 2009, pp. 1–6.Google Scholar
[167] M., Zulhasnine, C., Huang, and A., Srinivasan, “Efficient resource allocation for device-to-device communication underlaying LTE network,” in Proc. IEEE 6th International Conference on Wireless and Mobile Computing, Oct. 2010, pp. 368–375.Google Scholar
[168] D., Halperin, J., Ammer, T., Anderson, and D., Wetherall, “Interference cancellation: Better receivers for a new wireless MAC,” in Proc. Hot Topics in Networks (HotNets – VI), Nov. 2007.Google Scholar
[169] K., Yang, Y., Wu, J., Huang, X., Wang, and S., Verdu, “Distributed robust optimization for communication networks,” in Proc. IEEE 6th International Conference on Wireless and Mobile Computing, Apr. 2008.Google Scholar
[170] K., Doppler, C. H., Yu, C. B., Ribeiro, and P., Janis, “Mode selection for device-to-device communication underlaying an LTE-advanced network,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Apr. 2010.Google Scholar
[171] C., Yu, K., Doppler, C., Ribeiro, and O., Tirkkonen, “Resource sharing optimization for device-to-device communication underlaying cellular networks,”IEEE Trans. Wireless Commun., vol. 10, no. 8, pp. 2752–2763, Aug. 2011.Google Scholar
[172] C., Yu, O., Tirkkonen, K., Doppler, and C., Ribeiro, “On the performance of device-to-device underlay communication with simple power control,” in Proc. IEEE 69th Vehicular Technology Conference (VTC – Spring), Apr. 2009.Google Scholar
[173] X., Xiao, X., Tao, and J., Lu, “A QoS-aware power optimization scheme in OFDMA systems with integrated device-to-device (D2D) communications,” in Proc. IEEE Vehicular Technology Conference Fall, Sept. 2011.Google Scholar
[174] C., Yu, K., Doppler, C., Ribeiro, and O., Tirkkonen, “Power optimization of device-to-device communication underlaying cellular communication,” in Proc. IEEE International Conference on Communications, Jun. 2009.Google Scholar
[175] J., Gu, S. J., Bae, B. G., Choi, and M. Y., Chung, “Dynamic power control mechanism for interference coordination of device-to-device communication in cellular networks,” in Proc. IEEE 70th Vehicular Technology Conference Fall, Jun. 2009.Google Scholar
[176] G., Fodor and N., Reider, “A distributed power control scheme for cellular network assisted D2D communications,” in Proc. IEEE Global Telecommunications Conference, Dec. 2011.Google Scholar
[177] H., Min, W., Seo, J., Lee, S., Park, and D., Hong, “Reliability improvement using receive mode selection in the device-to-device uplink period underlaying cellular networks,”IEEE Trans. Wireless Commun., vol. 10, no. 2, pp. 413–418, Feb. 2011.Google Scholar
[178] P., Janis, V., Koivunen, C., Ribeiro, K., Doppler, and K., Hugl, “Interference-avoiding MIMO schemes for device-to-device radio underlaying cellular networks,” in Proc. IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications,Sept. 2009.Google Scholar
[179] S. A., Grandhi and J., Zander, “Constrained power control,”IEEE Trans. Wireless Commun., vol. 1, no. 4, pp. 257–270, 1995.Google Scholar
[180] T., Arnold and U., Schwalbe, “Dynamic coalition formation and the core,”J. Economic Behavior Organization, vol. 49, no. 3, pp. 363–380, Nov. 2002.Google Scholar
[181] P., Gilmore and R., Gomory, “A linear programming approach to the cutting stock problem part II,”Operations Res., vol. 11, no. 6, pp. 94–120, Dec. 1963.Google Scholar
[182] L., Le and E., Hossain, “QoS-aware spectrum sharing in cognitive wireless networks,” in Proc. IEEE GLOBECOM, Washington, DC, 2007, pp. 3563–3567.Google Scholar
[183] L., Song and J., Shen, Evolved Cellular Network Planning and Optimization for UMTS and LTE. CRC Press, 2010.Google Scholar
[184] “Apparatus and method for transmitter power control for device-to-device communications in a communication system,” patent US 2012/0028672 A1.
[185] “Method, apparatus and computer program for power control to mitigate interference,” patent US 2009/0325625 A1.
[186] ITU-R M.2135-1, “Guidelines for evaluation of radio interface technologies for IMT-advanced,” http://www.itu.int/pub/R-REP-M.2135-1-2009, Dec. 2009.
[187] M., Haenggi, J. G., Andrews, F., Baccelli, O., Dousse, and M., Franceschetti, “Stochastic geometry and random graphs for the analysis and design of wireless networks,”IEEE J. Selected Areas Commun., vol. 27, no. 7, pp. 1029–1046, Sept. 2009.Google Scholar
[188] A., Pikovsky, “Pricing and bidding strategies in iterative combinatorial auctions,” Ph.D. Dissertation, 2008.Google Scholar
[189] T., Wang, L., Song, Z., Han, and B., Jiao, “Dynamic popular content distribution in vehicular networks using coalition formation games,”IEEE J. Selected Areas Commun., vol. 31, no. 9, pp. 538–547, Sept. 2013.Google Scholar
[190] T., Ma, M., Hempel, D., Peng, and H., Sharif, “A survey of energy-efficient compression and communication techniques for multimedia in resource constrained systems,”IEEE Commun. Surveys Tutorials, vol. 15, no. 3, pp. 963–972, Jul.–Sept. 2013.Google Scholar
[191] S., Mantzouratos, G., Gardikis, H., Koumaras, and A., Kourtis, “Survey of cross-layer proposals for video streaming over mobile ad hoc networks (MANETS),” in Proc. IEEE International Conference on Telecommunications and Multimedia (TEMU), Jul.–Aug. 2012, pp. 101–106.Google Scholar
[192] F., Foukalas, V., Gazis, and N., Alonistioti, “Cross-layer design proposals for wireless mobile networks: A survey and taxonomy,”IEEE Commun. Surveys Tutorials, vol. 10, no. 1, pp. 70–85, Jan.–Mar. 2008.Google Scholar
[193] B., Fu, Y., Xiao, H., Deng, and H., Zeng, “A survey of cross-layer designs in wireless networks,”IEEE Commun. Surveys Tutorials, vol. 16, no. 1, pp. 110–126, Jan.–Mar. 2014.Google Scholar
[194] S., Shakkottai, T. S., Rappaport, and P. C., Karlsson, “Cross-layer design for wireless networks,”IEEE Commun. Mag., vol. 41, no. 10, pp. 74–80, Oct. 2003.Google Scholar
[195] V., Srivastava and M., Motani, “Cross-layer design: A survey and the road ahead,”IEEE Commun. Mag., vol. 43, no. 12, pp. 112–119, Dec. 2005.Google Scholar
[196] K., Karakayali, J. H., Kang, M., Kodialam, and K., Balachandran, “Cross-layer optimization for OFDMA-based wireless mesh backhaul networks,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), Mar. 2007, pp. 276–281.Google Scholar
[197] G., Carneiro, J., Ruela, and M., Ricardo, “Cross-layer design in 4G wireless terminals,”IEEE Commun. Mag., vol. 11, no. 2, pp. 7–13, Apr. 2004.Google Scholar
[198] V., Kawadia and P. R., Kumar, “A cautionary perspective on cross-layer design,”IEEE Wireless Commun., vol. 12, no. 1, pp. 3–11, Feb. 2005.Google Scholar
[199] X., Lin, N. B., Shroff, and R., Srikant, “A tutorial on cross-layer optimization in wireless networks,”IEEE J. Selected Areas Commun., vol. 24, no. 8, pp. 1452–1463, Aug. 2006.Google Scholar
[200] X., Liu, E. K. P., Chong, and N. B., Shroff, “A framework for opportunistic scheduling in wireless networks,”Computer Networks, vol. 41, no. 4, pp. 451–474, Mar. 2003.Google Scholar
[201] F., Kelly, “Charging and rate control for elastic traffic,”European Trans. Telecommun., vol. 8, no. 1, pp. 33–37, Feb. 1997.Google Scholar
[202] G., Song and Y., Li, “Cross-layer optimization for OFDM wireless networks – part I: Theoretical framework,”IEEE Trans. Wireless Commun., vol. 4, no. 2, pp. 614–624, Mar. 2005.Google Scholar
[203] G., Song and Y., Li, “Cross-layer optimization for OFDM wireless networks – part II: Algorithm development,”IEEE Trans. Wireless Commun., vol. 4, no. 2, pp. 625–634, Mar. 2005.Google Scholar
[204] Z., Jiang, Y., Ge, and Y. G., Li, “Max-utility wireless resource management for best effort traffic,”IEEE Trans. Wireless Commun., vol. 4, no. 1, pp. 100–111, Jan. 2005.Google Scholar
[205] X., Lin and N. B., Shroff, “The impact of imperfect scheduling on cross-layer congestion control in wireless networks,”IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 302–315, Apr. 2006.Google Scholar
[206] B., Jarupan and E., Ekici, “A survey of cross-layer design for VANETS,”Ad Hoc Networks, vol. 9, no. 5, pp. 966–983, Jul. 2011.Google Scholar
[207] J., Camp and E., Knightly, “Modulation rate adaptation in urban and vehicular environments: Cross-layer implementation and experimental evaluation,” in Proc. ACM International Conference on Mobile Computing and Networking (MobiCom), Sept. 2008, pp. 315–326.Google Scholar
[208] K.-L., Chiu, R.-H., Hwang, and Y.-S., Chen, “Cross-layer design vehicle-aided handover scheme in VANETS,”Wireless Commun. Mobile Computing, vol. 11, no. 7, pp. 916–928, Jul. 2011.Google Scholar
[209] N., Sofra, A., Gkelias, and K. K., Leung, “Link residual-time estimation for VANET cross-layer design,” in Proc. International Workshop on Cross Layer Design (IWCLD), Jun. 2009, pp. 1–5.Google Scholar
[210] J. P., Singh, N., Bambos, B., Srinivasan, and D., Clawin, “Cross-layer multi-hop wireless routing for inter-vehicle communication,” in Proc. International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM), Barcelona, Mar. 2006.Google Scholar
[211] H., Menouar, M., Lenardi, and F., Filali, “Movement prediction-based routing (MOPR) concept for position-based routing in vehicular networks,” in Proc. IEEE Vehicular Technology Conference (VTC) Fall, Sep.–Oct. 2007, pp. 2101–2105.Google Scholar
[212] G., Korkmaz, E., Ekici, and F., Ozguner, “A cross-layer multihop data delivery protocol with fairness guarantees for vehicular networks,”IEEE Trans. Vehicular Technol., vol. 55, no. 3, pp. 865–875, May 2006.Google Scholar
[213] R., Schmilz, A., Leiggener, A., Festag, L., Eggert, and W., Effelsberg, “Analysis of path characteristics and transport protocol design in vehicular ad hoc networks,” in Proc. IEEE Vehicular Technology Conference (VTC) Spring, vol. 2, May 2006, pp. 528–532.Google Scholar
[214] L., Zhou, B., Zheng, B., Geller et al., “Cross-layer rate control, medium access control and routing design in cooperative VANET,”Computer Commun., vol. 31, no. 12, pp. 2870–2882, Jul. 2008.Google Scholar
[215] M., Drigo, W., Zhang, R., Baldessari et al., “Distributed rate control algorithm for VANETS (DRCV),” in Proc. ACM International Workshop on VehiculAr InterNETworking (VANET), Sept. 2009, pp. 119–120.Google Scholar
[216] A., Chen, B., Khorashadi, D., Ghosal, and C., Chuah, “Impact of transmission power on TCP performance in vehicular ad hoc networks,” in Proc. IEEE/IFIP Wireless On-demand Networks and Services (WONS), Jan. 2007, pp. 65–71.Google Scholar
[217] B., Khorashadi, A., Chen, D., Ghosal, C., Chuah, and M., Zhang, “Impact of transmission power on the performance of UDP in vehicular ad hoc networks,” in Proc. IEEE International Conference on Communications (ICC), Jun. 2007, pp. 3698–3703.Google Scholar
[218] J., Eriksson, H., Balakrishnan, and S., Madden, “Cabernet: Vehicular content delivery using WiFi,” in Proc. ACM International Conference on Mobile Computing and Networking (MobiCom), Sept. 2008, pp. 199–210.Google Scholar
[219] X., Zhu, S., Wen, C., Wang et al., “A cross-layer study: Information correlation based scheduling scheme for device-to-device radio underlaying cellular networks,” in Proc. International Conference on Telecommunications (ICT), Apr. 2012.Google Scholar
[220] Y., Zeng, N., Xiong, L. T., Yang, and Y., Zhang, “Cross-layer routing in wireless sensor networks for machine-to-machine intelligent hazard monitoring applications,” in Proc. IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Apr. 2011, pp. 206–211.Google Scholar
[221] Y., Zeng, C. J., Sreenan, and L., Sitanayah, “A real-time and robust routing protocol for building fire emergency applications using wireless sensor networks,” in Proc. IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops), Mar.–Apr. 2010, pp. 358–363.Google Scholar
[222] O., Chipara, Z., He, G., Xing et al., “Real-time power-aware routing in sensor networks,” in Proc. IEEE International Workshop on Quality of Service (IWQoS), Jun. 2006, pp. 83–92.Google Scholar
[223] H., Luo, S., Ci, and D., Wu, “A cross-layer optimized distributed scheduling algorithm for peer-to-peer video streaming over multi-hop wireless mesh networks,” in Proc. IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), Jun. 2009, pp. 1–9.Google Scholar
[224] X., Zhang, J., Liu, B., Li, and T. P., Yum, “Coolstreaming/donet: A data-driven overlay network for peer-to-peer live media streaming,” in Proc. INFOCOM, vol. 3, Mar. 2005, pp. 2102–2111.Google Scholar
[225] FCC, “Connecting America: The national broadband plan,” Technical Report, Mar. 2010.
[226] T. E., Humphreys, B. M., Ledvina, M. L., Psiaki, B. W., O'Hanlon, and P. M., Kintner, “Assessing the spoofing threat: Development of a portable GPS civilian spoofer,” in Proc. 21st International Technical Meeting of the Satellite Division of the Institute of Navigation, ION GNSS, Savannah, GA, Sept. 2008, pp. 2314–2325.Google Scholar
[227] N. O., Tippenhauer, C., Popper, K. B., Rasmussen, and S., Capkun, “On the requirements for successful GPS spoofing attacks,” in Proc. 18th ACM Conference on Computer and Communications Security, CCS, Chicago, IL, Oct. 2011, pp. 75–86.Google Scholar
[228] E., Mills, “Drones can be hijacked via GPS spoofing attack,” June 29, 2012. http://news.cnet.com/8301-1009_3-57464271-83/drones-can-be-hijacked-via-gps-spoofing-attack.Google Scholar
[229] A., Rawnsley, “Iran's alleged drone hack: Tough, but possible,”Wired, Dec 2011. http://www.wired.com/dangerroom/2011/12/iran-drone-hack-gps/?utm_source=Contextly&utm_medium=RelatedLinks&utm_campaign=Previous.Google Scholar
[230] S., Lawson, “FCC to move on sharing scheme that could free up 100 MHz of wireless spectrum,”PC World, Sept. 13, 2012. http://www.pcworld.com/article/262301/fcc_to_move_ on_sharing_scheme_that_could_free_up_100mhz_of_wireless_spectrum.html.Google Scholar
[231] S., Kim, H., Jeon, and J., Ma, “Robust localization with unknown transmission power for cognitive radio,” in Proc. IEEE MILCOM, Orlando, FL, Oct. 2007, pp. 1–6.Google Scholar
[232] M., Robinson and I., Psaromiligkos, “Received signal strength based location estimation of a wireless LAN client,” in Proc. IEEE WCNC, New Orleans, LA, Mar. 2005, pp. 2350–2354.Google Scholar
[233] J., Yang and Y., Chen, “Indoor localization using improved RSS-based lateration methods,” in Proc. IEEE GLOBECOM, Honolulu, HI, Dec. 2009, pp. 1–6.Google Scholar
[234] X., Cheng, A., Thaeler, G., Xue, and D., Chen, “TPS: A time-based positioning scheme for outdoor wireless sensor networks,”Proc. IEEE INFOCOM, vol. 4, pp. 2685–2696, Mar. 2004.Google Scholar
[235] S. A., Golden and S. S., Bateman, “Sensor measurements for Wi-Fi location with emphasis on time-of-arrival ranging,”IEEE Trans. Mobile Computing, vol. 6, no. 10, pp. 1185–1198, Oct. 2007.Google Scholar
[236] N. B., Priyantha, A., Chakraborty, and H., Balakrishnan, “The cricket location-support system,” in Proc. 6th Annual International Conference on Mobile Computing and Networking, MobiCom, Boston, MA, Aug. 2000, pp. 32–43.Google Scholar
[237] D., Niculescu and B., Nath, “Ad hoc positioning system (APS) using AOA,” in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 2003, pp. 1734–1743.Google Scholar
[238] P., Rong and M., Sichitiu, “Angle of arrival localization for wireless sensor networks,” in Proc. 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks (SECON), Reston, VA, Sept. 2006, pp. 374–382.Google Scholar
[239] P., Bahl and V. N., Padmanabhan, “Radar: An in-building RF-based user location and tracking system,” in Proc. IEEE INFOCOM, Tel Aviv, Mar. 2000, pp. 775–784.Google Scholar
[240] P., Bahl and V. N., Padmanabhan, “Enhancements to the radar user location and tracking system,” Microsoft Research, Technical Report, Feb. 2000.
[241] C., Feng, W., Au, S., Valaee, and Z., Tan, “Compressive sensing based positioning using RSS of WLAN access points,” in Proc. IEEE INFOCOM, San Diego, CA, Mar. 2010, pp. 1–9.Google Scholar
[242] K., Kaemarungsi and P., Krishnamurthy, “Modeling of indoor positioning systems based on location fingerprinting,” in Proc. IEEE INFOCOM, Hongkong, Mar. 2004, pp. 1012–1022.Google Scholar
[243] S., Sen, B., Radunovic, R., Choudhury, and T., Minka, “Spot localization using PHY layer information,” in Proc. ACM MOBISYS, Low Wood Bay, Lake District, Jun. 2012, pp. 183– 196.Google Scholar
[244] S., Sen, B., Radunovic, R. R., Choudhury, and T., Minka, “Precise indoor localization using PHY information,” in Proc. 9th International Conference on Mobile Systems, Applications, and Services, MobiSys, Washington, DC, Jun. 2011, pp. 413–414.Google Scholar
[245] Y., Chen, D., Lymberopoulos, J., Liu, and B., Priyantha, “FM-based indoor localization,” in Proc. 10th International Conference on Mobile Systems, Applications, and Services, MobiSys, Low Wood Bay, Lake District, Jun. 2012, pp. 169–182.Google Scholar
[246] M., Azizyan, I., Constandache, and R. R., Choudhury, “Surroundsense: Mobile phone localization via ambience fingerprinting,” in Proc. 15th Annual International Conference on Mobile Computing and Networking, MobiCom, Beijing, Sept. 2009, pp. 261–272.Google Scholar
[247] N., Bulusu, J., Heidemann, and D., Estrin, “GPS-less low-cost outdoor localization for very small devices,”IEEE Personal Commun., vol. 7, no. 5, pp. 28–34, Oct. 2000.Google Scholar
[248] T., He, C., Huang, B. M., Blum, J. A., Stankovic, and T., Abdelzaher, “Range-free localization schemes for large scale sensor networks,” in Proc. 9th Annual International Conference on Mobile Computing and Networking, MobiCom, San Diego, CA, Sept. 2003, pp. 81–95.Google Scholar
[249] Y., Shang, W., Ruml, Y., Zhang, and M., Fromherz, “Localization from connectivity in sensor networks,”IEEE Trans. Parallel Distributed Systems, vol. 15, no. 11, pp. 961–974, Nov. 2004.Google Scholar
[250] Y., Shang, W., Ruml, Y., Zhang, and M. P. J., Fromherz, “Localization from mere connectivity,” in Proc. 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, MobiHoc, Annapolis, MD, Jun. 2003, pp. 201–212.Google Scholar
[251] I., Constandache, X., Bao, M., Azizyan, and R. R., Choudhury, “Did you see Bob?: Human localization using mobile phones,” in Proc. 16th Annual International Conference on Mobile Computing and Networking, MobiCom, Chicago, IL, Sept. 2010, pp. 149–160.Google Scholar
[252] I., Constandache, R. R., Choudhury, and I., Rhee, “Towards mobile phone localization without war-driving,” in Proc. IEEE INFOCOM, San Diego, CA, Mar. 2010, pp. 1–9.Google Scholar
[253] B., Zhang, J., Teng, J., Zhu et al., “Ev-loc: Integrating electronic and visual signals for accurate localization,” in Proc. 13th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc, Hilton Head Island, CA, Jun. 2012, pp. 25–34.Google Scholar
[254] H., Liu, Y., Gan, J., Yang et al., “Push the limit of WiFi based localization for smartphones,” in Proc. 18th Annual International Conference on Mobile Computing and Networking, MobiCom, Istanbul, Aug. 2012, pp. 305–316.Google Scholar
[255] J. G., Manweiler, P., Jain, and R. R., Choudhury, “Satellites in our pockets: An object positioning system using smartphones,” in Proc. 10th International Conference on Mobile Systems, Applications, and Services, MobiSys, Low Wood Bay, Lake District, Jun. 2012, pp. 211–224.Google Scholar
[256] S., Sen, R. R., Choudhury, and S., Nelakuditi, “Spinloc: Spin once to know your location,” in Proc. Twelfth Workshop on Mobile Computing Systems & Applications, HotMobile, San Diego, CA, Feb. 2012, p. 12.Google Scholar
[257] H., Wang, S., Sen, A., Elgohary et al., “No need to war-drive: Unsupervised indoor localization,” in Proc. 10th International Conference on Mobile Systems, Applications, and Services, MobiSys, Low Wood Bay, Lake District, Jun. 2012, pp. 197–210.Google Scholar
[258] Y., Chen, W., Trappe, and R. P., Martin, “Attack detection in wireless localization,” in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 1964–1972.Google Scholar
[259] K., Bauer, D., McCoy, E., Anderson et al., “The directional attack on wireless localization: How to spoof your location with a tin can,” in Proc. IEEE GLOBECOM, Honolulu, HI, Dec. 2009, pp. 1–6.Google Scholar
[260] N. O., Tippenhauer, C., Popper, K. B., Rasmussen, and S., Capkun, “On the requirements for successful GPS spoofing attacks,” in Proc. 18th ACM Conference on Computer and Communications Security (CCS), Chicago, IL, Oct. 2011, pp. 75–86.Google Scholar
[261] L., Hu and D., Evans, “Using directional antennas to prevent wormhole attacks,” in Network and Distributed System Security Symposium, San Diego, CA, Feb. 2004, pp. 131–141.Google Scholar
[262] L., Lazos and R., Poovendran, “Serloc: Secure range-independent localization for wireless sensor networks,” in Wireless Security, Philadelphia, PA, Oct. 2004, pp. 21–30.Google Scholar
[263] S., Capkun, M., Cagalj, and M., Srivastava, “Secure localization with hidden and mobile base stations,” in Proc. 25th IEEE International Conference on Computer Communications, INFOCOM, Barcelona, Apr. 2006, p. 110.Google Scholar
[264] L., Lazos and R. P., Hirloc, “High-resolution robust localization for wireless sensor networks,”IEEE J. Selected Areas Commun., vol. 24, no. 2, p. 233–246, Feb. 2006.Google Scholar
[265] N., Sastry, U., Shankar, and D., Wagner, “Secure verification of location claims,” in Proc. 2nd ACM Workshop on Wireless Security, San Diego, CA, Sept. 2003, p. 110.Google Scholar
[266] S.-H., Fang, C.-C., Chuang, and C., Wang, “Attack-resistant wireless localization using an inclusive disjunction model,”IEEE Trans. Commun., vol. 60, no. 5, pp. 1209–1214, May 2012.Google Scholar
[267] Y., Hu, A., Perrig, and D., Johnson, “Packet leashes: A defense against wormhole attacks in wireless networks,”Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, INFOCOM, vol. 3, pp. 1976–1986, Apr. 2003.Google Scholar
[268] J. H., Lee and R., Buehrer, “Location spoofing attack detection in wireless networks,” in Proc. IEEE INFOCOM, Miami, FL, Dec. 2010, p. 16.Google Scholar
[269] X., Li, Y., Chen, J., Yang, and X., Zheng, “Designing localization algorithms robust to signal strength attacks,” in Proc. IEEE INFOCOM, Shanghai, Apr. 2011, pp. 341–345.Google Scholar
[270] Z., Li, W., Trappe, Y., Zhang, and B., Nath, “Robust statistical methods for securing wireless localization in sensor networks,” in Fourth International Symposium on Information Processing in Sensor Networks, IPSN, Los Angeles, CA, Apr. 2005, pp. 91–98.Google Scholar
[271] D., Liu, P., Ning, and W., Du, “Attack-resistant location estimation in sensor networks,” in Fourth International Symposium on Information Processing in Sensor Networks, IPSN, Los Angeles, CA, Apr. 2005, pp. 99–106.Google Scholar
[272] J. S., Warner and R. G., Johnston, “GPS spoofing countermeasures,”Homeland Security Journal, Dec. 2003.Google Scholar
[273] Y., Zhang, W., Liu, Y., Fang, and D., Wu, “Secure localization and authentication in ultra-wideband sensor networks,”IEEE J. Selected Areas Commun., vol. 24, no. 4, pp. 829–835, Apr. 2006.Google Scholar
[274] P., Bao and M., Liang, “A security localization method based on threshold and vote for wireless sensor networks,”Procedia Engineering, vol. 15, no. 12, pp. 2783–2787, Dec. 2011.Google Scholar
[275] Q., Mi, J. A., Stankovic, and R., Stoleru, “Secure walking GPS: A secure localization and key distribution scheme for wireless sensor networks,” in Proc. Third ACM Conference on Wireless Network Security, WiSec, Hoboken, NJ, Mar. 2010, pp. 163–168.Google Scholar
[276] S. K., Leung-Yan-Cheong and M. E., Hellman, “The Gaussian wiretap channel,”IEEE Trans. Information Theory, vol. 24, no. 4, pp. 451–456, Jul. 1978.Google Scholar
[277] A. D., Wyner, “The wire-tap channel,”Bell. Syst. Tech. J., vol. 54, no. 8, pp. 1355–1387, Oct. 1975.Google Scholar
[278] P. C., Pinto, J., Barros, and M. Z., Win, “Physical-layer security in stochastic wireless networks,” in 11th IEEE Singapore International Conference on Communication Systems, Singapore, Nov. 2008.Google Scholar
[279] Z., Shu, Y., Yang, Y., Qian, and R. Q., Hu, “Impact of interference on secrecy capacity in a cognitive radio network,” in Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, Dec. 2011.Google Scholar
[280] G., Karagiannis, O., Altintas, E., Ekici et al., “Vehicular networking: A survey and tutorial on requirements, architectures, challenges, standards and solutions,”Commun. Surveys Tutorials, vol. 13, no. 4, pp. 584–616, Oct.–Dec. 2011.Google Scholar
[281] ETSI, “Intelligent transport system (ITS); vehicular communications; basic set of applications; definition,” Technical Report, Jun. 2009, ETSI Std. ETSI ITS Specification TR 102 638 version 1.1.1.
[282] J., Misic, G., Badawy, and V. B., Misic, “Performance characterization for IEEE 802.11p network with single channel devices,”IEEE Trans. Vehicular Technol., vol. 60, no. 4, pp. 1775–1787, 2011.Google Scholar
[283] X., Chen and D., Yao, “An empirically comparative analysis of 802.11n and 802.11p performances in CVIS,” in Proc. International Conference on ITS Telecommunications (ITST), Taipei, Taiwan, Nov. 2012, pp. 848–851.Google Scholar
[284] C.-S., Lin, B.-C., Chen, and J.-C., Lin, “Field test and performance improvement in IEEE 802.11p v2r/r2v environments,” in Proc. IEEE International Conference on Communications Workshops (ICC), Cape Town, May 2010, pp. 1–5.Google Scholar
[285] H., Guo, S. T., Goh, N. C. S., Foo, Q., Zhang, and W.-C., Wong, “Performance evaluation of 802.11p device for secure vehicular communication,” in Proc. International Wireless Communications and Mobile Computing Conference (IWCMC), Jul. 2011, pp. 1170–1175.Google Scholar
[286] J. A., Fernandez, K., Borries, L., Cheng et al., “Performance of the 802.11p physical layer in vehicle-to-vehicle environments,”IEEE Trans. Vehicular Technol., vol. 61, no. 1, pp. 3–14, 2012.Google Scholar
[287] C., Han, M., Dianati, R., Tafazolli, R., Kernchen, and X., Shen, “Analytical study of the IEEE 802.11p MAC sublayer in vehicular networks,”IEEE Trans. Intelligent Transportation Systems, vol. 13, no. 2, pp. 873–886, 2012.Google Scholar
[288] J.-C., Lin, C.-S., Lin, C.-N., Liang, and B.-C., Chen, “Wireless communication performance based on IEEE 802.11p r2v field trials,”IEEE Commun. Mag., vol. 50, no. 5, pp. 184–191, 2012.Google Scholar
[289] T., Sukuvaara, R., Ylitalo, and M., Katz, “IEEE 802.11p based vehicular networking operational pilot field measurement,”IEEE J. Selected Areas Commun., vol. 31, no. 9, pp. 409–417, Sept. 2013.Google Scholar
[290] S., Cespedes, N., Lu, and X., Shen, “VIP-wave: On the feasibility of IP communications in 802.11p vehicular networks,”IEEE Trans. Intelligent Transportation Systems, vol. 14, no. 1, pp. 82–97, Mar. 2013.Google Scholar
[291] F., Li and Y., Wang, “Routing in vehicular ad hoc networks: A survey,”IEEE Vehicular Technol. Mag., vol. 2, no. 2, pp. 12–22, Jun. 2007.Google Scholar
[292] C. E., Perkins and E. M., Royer, “Ad-hoc on demand distance vector routing,” in Proc. IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), Feb. 1999, pp. 90–100.Google Scholar
[293] D. B., Johnson and D. A., Maltz, Mobile Computing. Springer, 1996, ch. Dynamic source routing in ad hoc wireless networks, pp. 153–181.Google Scholar
[294] V., Namboodiri, M., Agarwal, and L., Gao, “A study on the feasibility of mobile gateways for vehicular ad-hoc networks,” in Proc. First International Workshop on Vehicular Ad Hoc Networks, Philadelphia, PA, Oct. 2004, pp. 66–75.Google Scholar
[295] S. Y., Wang, C. C., Lin, Y. W., Hwang, K. C., Tao, and C. L., Chou, “A practical routing protocol for vehicle-formed mobile ad hoc networks on the roads,” in Proc. IEEE International Conference on Intelligent Transportation Systems, Vienna, Sept. 2005, pp. 161–165.Google Scholar
[296] V., Namboodiri and L., Gao, “Prediction-based routing for vehicular ad hoc networks,”IEEE Trans. Vehicular Technol., vol. 56, no. 4, pp. 2332–2345, Jul. 2007.Google Scholar
[297] B., Karp and H. T., Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in Proc. ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Boston, MA, Aug. 2000, pp. 243–254.Google Scholar
[298] H., Fubler, M., Mauve, H., Hartenstein, M., Kasemann, and D., Vollmer, “Location-based routing for vehicular ad-hoc networks,”ACM SIGMOBILE Mobile Computing and Communications Review (MC2R), vol. 7, no. 1, pp. 47–49, Jan. 2003.Google Scholar
[299] E. H., Wu, P. K., Sahu, and J., Sahoo, “Destination discovery oriented position based routing in VANET,” in Proc. IEEE Asia–Pacific Services Computing Conference (APSCC),Dec. 2008, pp. 1606–1610.Google Scholar
[300] Y., Ohta, T., Ohta, and Y., Kakuda, “An autonomous clustering-based data transfer scheme using positions and moving direction of vehicles for VANETS,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), Apr. 2012, pp. 2900–2904.Google Scholar
[301] M., Durresi, A., Durresi, and L., Barolli, “Emergency broadcast protocol for intervehicle communications,” in Proc. International Conference on Parallel and Distributed Systems Workshops (ICPADS), Fukuoka, Jul. 2005, pp. 402–406.Google Scholar
[302] G. K. E., Ekici, F., Ozguner, and U., Ozguner, “Urban multi-hop broadcast protocol for inter-vehicle communication systems,” in ACM International Workshop on Vehicular Ad Hoc Networks, Philadelphia, PA, Oct. 2004, pp. 76–85.Google Scholar
[303] M., Sun, W., Feng, T.-H., Lai et al., “GPS-based message broadcasting for inter-vehicle communication,” in Proc. International Conference on Parallel Processing (ICPP), Toronto, Aug. 2000, pp. 279–286.Google Scholar
[304] S., Panichpapiboon and W., Pattara-Atikom, “A review of information dissemination protocols for vehicular ad hoc networks,”Commun. Surveys Tutorials, vol. 14, no. 3, pp. 784–798, Oct.–Dec. 2012.Google Scholar
[305] T., Zhong, B., Xu, and O., Wolfson, “Disseminating real-time traffic information in vehicular ad-hoc networks,” in Proc. IEEE Intelligent Vehicles Symposium (IV), Jan. 2008, pp. 1056–1061.Google Scholar
[306] T., Fujiki, M., Kirimura, T., Umedu, and T., Higashino, “Efficient acquisition of local traffic information using inter-vehicle communication with queries,” in Proc. IEEE Intelligent Transportation Systems Conference (ITSC), Sept. 2007, pp. 241–246.Google Scholar
[307] D., Li, H., Huang, X., Li, M., Li, and F., Tang, “A distance-based directional broadcast protocol for urban vehicular ad hoc network,” in Proc. International Conference on Wireless Communications, Networking and Mobile Computing (WiCom), Sept. 2007, pp. 1520–1523.Google Scholar
[308] N., Wisitpongphan, O. K., Tonguz, J. S., Parikh et al., “Broadcast storm mitigation techniques in vehicular ad hoc networks,”IEEE Wireless Commun., vol. 14, no. 6, pp. 84–94, Dec. 2007.Google Scholar
[309] L., Li, R., Ramjee, M., Buddhikot, and S., Miller, “Network coding-based broadcast in mobile ad-hoc networks,” in Proc. IEEE International Conference on Computer Communications (INFOCOM), May 2007, pp. 1739–1747.Google Scholar
[310] Y.-S., Chen, Y.-W., Lin, and S.-L., Lee, “A mobicast routing protocol in vehicular ad-hoc networks,” in Proc. IEEE Global Telecommunications Conference (GLOBECOM),Nov.– Dec. 2009, pp. 1–6.Google Scholar
[311] B., Zhou, H., Hu, S.-Q., Huang, and H.-H., Chen, “Intracluster device-to-device relay algorithm with optimal resource utilization,”IEEE Trans. Vehicular Technol., vol. 62, no. 5, pp. 2315–2326, Jun. 2013.Google Scholar
[312] B., Shrestha, D., Niyato, Z., Han, and E., Hossain, “Wireless access in vehicular environments using BitTorrent and bargaining,” in Proc. IEEE Global Telecommunications Conference (GLOBECOM), Nov.–Dec. 2008, pp. 1–5.Google Scholar
[313] D., Qiu and R., Srikant, “Modeling and performance analysis of BitTorrentlike peer–peer networks,”SIGCOMM Computer Commun. Rev., vol. 34, no. 4, pp. 367–378, Oct. 2004.Google Scholar
[314] T. S., Rappaport, Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall, 2002.Google Scholar
[315] M. H., Ahmed, H., Yanikomeroglu, and S., Mahmoud, “Fairness enhancement of link adaptation techniques in wireless networks,” in Proc. IEEE Vehicular Technology Conference (VTC), vol. 4, Oct. 2003, pp. 1554–1557.Google Scholar
[316] D., Niyato, E., Hossain, and P., Wang, “Optimal channel access management with QoS support for cognitive vehicular networks,”IEEE Trans. Mobile Computing, vol. 10, no. 4, pp. 573–591, Feb. 2011.Google Scholar
[317] M. M., Buddhikot, “Understanding dynamic spectrum access: Models, taxonomy and challenges,” in Proc. IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN), Apr. 2007, pp. 649–663.Google Scholar
[318] L., Le and E., Hossain, “A MAC protocol for opportunistic spectrum access in cognitive radio networks,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), Mar.–Apr. 2008, pp. 1426–1430.Google Scholar
[319] Q., Liu, S., Zhou, and G. B., Giannakis, “Cross-layer combining of adaptive modulation and coding with truncated ARQ over wireless links,”IEEE Trans. Wireless Commun.,vol. 3, no. 5, pp. 1746–1755, Sept. 2004.Google Scholar
[320] M. L., Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley-Interscience, 1994.Google Scholar
[321] N., Kayastha, D., Niyato, P., Wang, and E., Hossain, “Applications, architectures, and protocol design issues for mobile social networks: A survey,”Proc. IEEE, vol. 99, no. 12, pp. 2130–2158, 2011.Google Scholar
[322] N., Vastardis and K., Yang, “Mobile social networks: Architectures, social properties, and key research challenges,”IEEE Commun. Surveys Tutorials, vol. 15, no. 3, pp. 1355–1371, Oct.–Dec. 2013.Google Scholar
[323] D. J., Watts and S. H., Strogatz, “Collective dynamics of ‘small-world’ networks,”Nature, vol. 393, pp. 440–442, 1998.Google Scholar
[324] Y., Zhu, B., Xu, X., Shi, and Y., Wang, “A survey of social-based routing in delay tolerant networks: Positive and negative social effects,”IEEE Commun. Surveys Tutorials, vol. 15, no. 1, pp. 387–401, Oct.–Dec. 2013.Google Scholar
[325] K., Wei, X., Liang, and K., Xu, “A survey of social-aware routing protocols in delay tolerant networks: Applications, taxonomy and design-related issues,”IEEE Commun. Surveys Tutorials, vol. 16, no. 1, pp. 556–578, Jan.–Mar. 2014.Google Scholar
[326] C.-M., Huang, K. C., Lan, and C.-Z., Tsai, “A survey of opportunistic networks,” in Proc. International Conference on Advanced Information Networking and Applications – Workshops (AINAW), Okinawa, Mar. 2008, pp. 1672–1677.Google Scholar
[327] J. G., Scott, Social Network Analysis: A Handbook. SAGE Publications, 2012.Google Scholar
[328] D., Knoke and S., Yang, Social Network Analysis (Quantitative Applications in the Social Sciences). SAGE Publications, 2007.Google Scholar
[329] T., Hossmann, F., Legendre, and T., Spyropoulos, “From contacts to graphs: Pitfalls in using complex network analysis for DTN routing,” in Proc. INFOCOM Workshops, Rio de Janeiro, Apr. 2009, pp. 1–6.Google Scholar
[330] M. E. J., Newman, “Detecting community structure in networks,”Eur. Phys. J. B – Condensed Matter Complex Systems, vol. 38, no. 2, pp. 321–330, Mar. 2004.Google Scholar
[331] L., Danon, J., Duch, A., Diaz-Guilera, and A., Arenas, “Comparing community structure identification,”J. Statist. Mech.: Theory Exp., p. 09008, 2005.Google Scholar
[332] G., Bigwood, D., Rehunathan, M., Bateman, T., Henderson, and S., Bhatti, “Exploiting self-reported social networks for routing in ubiquitous computing environments,” in Proc. IEEE International Conference on Wireless and Mobile Computing, Networking and Communication (WiMob), Avignon, Oct. 2008, pp. 484–489.Google Scholar
[333] K., Jahanbakhsh, G. C., Shoja, and V., King, “Social-greedy: A socially-based greedy routing algorithm for delay tolerant networks,” in Proc. Second International Workshop on Mobile Opportunistic Networking, Pisa, Feb. 2010, pp. 159–162.Google Scholar
[334] M. E. J., Newman, “Fast algorithm for detecting community structure in networks,”Phys. Rev. E, vol. 63, no. 6, p. 066133, Jun. 2004.Google Scholar
[335] M., Girvan and M. E. J., Newman, “Community structure in social and biological networks,”Proc. Nat. Acad. Sci. USA, vol. 99, no. 12, pp. 7821–7826, Jun. 2002.Google Scholar
[336] N. P., Nguyen, Y. X. T. N., Dinh, and M. T., Thai, “Adaptive algorithms for detecting community structure in dynamic social networks,” in Proc. IEEE INFOCOM, Shanghai, Apr. 2011, pp. 2282–2290.Google Scholar
[337] V. D., Blondel, J., Guillaume, R., Lambiotte, and E., Lefebvre, “Fast unfolding of communities in large networks,”J. Statist. Mech.: Theory Exp., p. 10008, Oct. 2008.Google Scholar
[338] Z., Ye, S., Hu, and J., Yu, “Adaptive clustering algorithm for community detection in complex networks,”Phys. Rev. E, vol. 78, no. 4, p. 046115, 2008.Google Scholar
[339] G., Palla, P., Pollner, A., Barabasi, and T., Vicsek, Adaptive Networks. Springer, 2009, ch. Social group dynamics in networks, pp. 11–38.Google Scholar
[340] A., Chaintreau, J. C. P., Hui, C., Diot, R., Gass, and J., Scot, “Impact of human mobility on opportunistic forwarding algorithms,”IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 606–620, Jun. 2007.Google Scholar
[341] P., Hui and J., Crowcroft, “How small labels create big improvements,” in Proc. IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops), White Plains, NY, Mar. 2007, pp. 65–70.Google Scholar
[342] T. N., Dinh, Y., Xuan, and M. T., Thai, “Towards social-aware routing in dynamic communication networks,” in Proc. IEEE International Performance Computing and Communications Conference (IPCCC), Phoenix, AZ, Dec. 2009, pp. 161–168.Google Scholar
[343] P., Hui, E., Yoneki, S.-Y., Chan, and J., Crowcroft, “Distributed community detection in delay tolerant networks,” in Proc. ACM International Workshop on Mobility in the Evolving Internet Architecture (MobiArch), no. 7, Kyoto, Aug. 2007.Google Scholar
[344] Haggle project, 2004. http://www.haggleproject.org.
[345] N., Eagle and A., Pentland, “Reality mining: Sensing complex social systems,”Personal and Ubiquitous Computing, vol. 10, no. 4, pp. 255–268, May 2006.Google Scholar
[346] M., McNett and G. M., Voelker, “Access and mobility of wireless PDA users,”SIGMOBILE Mobile Computing Commun. Rev., vol. 9, no. 2, pp. 40–55, Apr. 2005.Google Scholar
[347] D., Kempe, J., Kleinberg, and E., Tardos, “Influential nodes in a diffusion model for social networks,” in International Colloquium on Automata, Languages and Programming, no. 32, Lisbon, Jul. 2005, pp. 1127–1138.Google Scholar
[348] P., Domingos and M., Richardson, “Mining the network value of customers,” in Proc. 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, Aug. 2001, pp. 57–66.Google Scholar
[349] D., Kempe, J., Kleinberg, and E., Tardos, “Maximizing the spread of influence through a social network,” in Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, Aug. 2003, pp. 137–146.Google Scholar
[350] J., Leskovec, A., Krause, C., Guestrin et al., “Cost-effective outbreak detection in networks,” in Proc. 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, Aug. 2007, pp. 420–429.Google Scholar
[351] W., Chen, Y., Wang, and S., Yang, “Efficient influence maximization in social networks,” in Proc. 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, Jun. 2009, pp. 199–208.Google Scholar
[352] Y., Wang, G., Cong, G., Song, and K., Xie, “Community-based greedy algorithm for mining top-k influential nodes in mobile social networks,” in Proc. 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, Jul. 2010, pp. 25–28.Google Scholar
[353] E. M., Daly and M., Haahr, “Social network analysis for routing in disconnected delay-tolerant MANETS,” in Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Montreal, QC, Sept. 2007, pp. 32–40.Google Scholar
[354] P., Hui, J., Crowcroft, and E., Yoneki, “Bubble rap: Social-based forwarding in delay tolerant networks,” in Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Hongkong, May 2008, pp. 241–250.Google Scholar
[355] G., Palla, I., Derenyi, I., Farkas, and T., Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,”Nature, vol. 435, no. 7043, pp. 814–818, Jun. 2005.Google Scholar
[356] M. E. J., Newman, “Analysis of weighted networks,”Phys. Rev. E, vol. 70, no. 5, p. 056131, Nov. 2004.Google Scholar
[357] A., Lindgren, A., Doria, and O., Schelen, “Probabilistic routing in intermittently connected networks,”ACM SIGMOBILE Mobile Computing Commun. Rev., vol. 7, no. 3, pp. 19–20, Jul. 2003.Google Scholar
[358] E., Bulut and B. K., Szymanski, “Exploiting friendship relations for efficient routing in mobile social networks,”IEEE Trans. Parallel Distributed Systems, vol. 23, no. 12, pp. 2254–2265, Dec. 2012.Google Scholar
[359] J., Fan, J., Chen, Y., Du et al., “Geocommunity-based broadcasting for data dissemination in mobile social networks,”IEEE Trans. Parallel Distributed Systems, vol. 24, no. 4, pp. 734–743, Apr. 2013.Google Scholar
[360] D., Niyato, P., Wang, W., Saad, and A., Hjorungnes, “Controlled coalitional games for cooperative mobile social networks,”IEEE Trans. Vehicular Technol., vol. 60, no. 4, pp. 1812–1824, May 2011.Google Scholar
[361] R., Nelson, Probability, Stochastic Processes, and Queueing Theory: The Mathematics of Computer Performance Modeling. Springer, 2010.Google Scholar
[362] Y.-K., Ip, W.-C., Lau, and O.-C., Yue, “Performance modeling of epidemic routing with heterogeneous node types,” in Proc. IEEE International Conference on Communications (ICC), Beijing, May 2008, pp. 219–224.Google Scholar
[363] D., Uckelmann, M., Harrison, and F., Michahelles, Architecting the Internet of Things. Springer, 2011.Google Scholar
[364] 3GPP, “Service requirements for machine-type communications,” Technical Report, 2012.
[365] 3GPP, “Evolved universal terrestrial radio access (E-UTRA) and evolved universal terrestrial radio access network (E-UTRAN), overall description,” Technical Report, Jun. 2012.
[366] Alcatel-Lucent, “The LTE network architecture,” Alcatel-Lucent, Technical Report, 2009.
[367] K., Zheng, F., Hu, W., Wang, W., Xiang, and M., Dohler, “Radio resource allocation in LTE-advanced cellular networks with M2M communications,”IEEE Commun. Mag., vol. 50, no. 7, pp. 184–192, Jul. 2012.Google Scholar
[368] S., Sesia, I., Toufik, and M., Baker, LTE, The UMTS Long Term Evolution: From Theory to Practice. Wiley Publishing, 2009, ch. 19.Google Scholar
[369] 3GPP, “Medium access control (MAC) protocol specification,” Technical Report, Mar. 2012.
[370] 3GPP, “Study on RAN improvements for machine-type communications,” Technical Report, Sept. 2011.
[371] M.-Y., Cheng, G.-Y., Lin, H.-Y., Wei, and A.-C., Hsu, “Overload control for machine-type-communications in LTE-advanced system,”IEEE Commun. Mag., vol. 50, no. 6, pp. 38–45, Jun. 2012.Google Scholar
[372] S.-Y., Lien, K.-C., Chen, and Y., Lin, “Toward ubiquitous massive accesses in 3GPP machine-to-machine communications,”IEEE Commun. Mag., vol. 49, no. 4, pp. 66–74, Apr. 2011.Google Scholar
[373] C.-Y., Tu, C.-Y., Ho, and C.-Y., Huang, “Energy-efficient algorithms and evaluations for massive access management in cellular based machine to machine communications,” in Proc. Vehicular Technology Conference (VTC Fall), Sept. 2011, pp. 1–5.Google Scholar
[374] S.-Y., Lien, T.-H., Liau, C.-Y., Kao, and K.-C., Chen, “Cooperative access class barring for machine-to-machine communications,”IEEE Trans. Wireless Commun., vol. 11, no. 1, pp. 27–32, Jan. 2012.Google Scholar
[375] J.-P., Cheng, C.-H., Lee, and T.-M., Lin, “Prioritized random access with dynamic access barring for RAN overload in 3GPP LTE-A networks,” in Proc. IEEE GLOBECOM Workshops, Dec. 2011, pp. 368–372.Google Scholar
[376] K.-D., Lee, S., Kim, and B., Yi, “Throughput comparison of random access methods for M2M service over LTE networks,” in Proc. IEEE GLOBECOM Workshops, Dec. 2011, pp. 373–377.Google Scholar
[377] S., Choi, W., Lee, D., Kim et al., “Automatic configuration of random access channel parameters in LTE systems,” in Proc. IFIP Wireless Days (WD), Oct. 2011, pp. 1–6.Google Scholar
[378] A., Lo, Y. W., Law, and M., Jacobsson, “Enhanced LTE-advanced random-access mechanism for massive machine-to-machine (M2M) communications,” in Proc. 27th Meeting of Wireless World Research Form (WWRF), Oct. 2011, pp. 1–5.Google Scholar
[379] S.-Y., Lien, K.-C., Chen, and Y., Lin, “Toward ubiquitous massive accesses in 3GPP machine-to-machine communications,”IEEE Commun. Mag., vol. 49, no. 4, pp. 66–74, Apr. 2011.Google Scholar
[380] M.-S., Lee and Y.-M., Choi, “An efficient receiver for preamble detection in LTE SC-FDMA systems with an antenna array,”IEEE Commun. Lett., vol. 14, no. 12, pp. 1167–1169, Dec. 2010.Google Scholar
[381] 3GPP, “Feasibility study for proximity services (ProSe),” Technical Report, Jun. 2013.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • References
  • Lingyang Song, Peking University, Beijing, Dusit Niyato, Nanyang Technological University, Singapore, Zhu Han, University of Houston, Ekram Hossain, University of Manitoba, Canada
  • Book: Wireless Device-to-Device Communications and Networks
  • Online publication: 05 March 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781107478732.014
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • References
  • Lingyang Song, Peking University, Beijing, Dusit Niyato, Nanyang Technological University, Singapore, Zhu Han, University of Houston, Ekram Hossain, University of Manitoba, Canada
  • Book: Wireless Device-to-Device Communications and Networks
  • Online publication: 05 March 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781107478732.014
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • References
  • Lingyang Song, Peking University, Beijing, Dusit Niyato, Nanyang Technological University, Singapore, Zhu Han, University of Houston, Ekram Hossain, University of Manitoba, Canada
  • Book: Wireless Device-to-Device Communications and Networks
  • Online publication: 05 March 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781107478732.014
Available formats
×