http://ieeexplore.ieee.org TOC Alert for Publication# 90 2013 May 23 21 2 C1 C4 593 21 2 C2 C2 124 21 2 345 358 1790 r. Subcells may be several orders of magnitude smaller than, e.g., microcells, resulting in what we refer to as a nanoscale network model (NSNM), including a special nanoscale channel model (NSCM) for this application. For such tessellation, a spatial interleaving SI MAC protocol is introduced for context-aware interlink interference management. The directed flooding routing protocol (DFRP) and interflooding network coding (IFNC) are proposed for such a network model including intercell flooding coordination (ICFC) protocol to minimize the intercell interference. By adjusting the radius of the subcell r , we obtain different hopping ranges that directly affect the throughput, power consumption, and interference. With r as the optimization parameter, in this paper we jointly optimize scheduling, routing, and power control to obtain the optimum tradeoff between throughput, delay, and power consumption in multicast cellular networks. A set of numerical results demonstrates that the NSNM enables high-resolution optimization of the system and an effective use of the context awareness.]]> 21 2 359 372 3725 21 2 373 382 2074 21 2 383 399 1544 21 2 400 412 1592 p-cycles and link shared protection, we propose to investigate here the stability of failure-independent path-protecting (FIPP) p-cycles under dynamic traffic. For doing so, we design and develop an original scalable mathematical model that we solve using large-scale optimization tools. Numerical results show that FIPP p-cycles are remarkably stable under the evaluation of the number of required optical bypass reconfigurations under dynamic traffic.]]> 21 2 413 425 2110 21 2 426 439 1613 k-hop clustered networks and compare to existing results on nonclustered stationary networks. By introducing k -hop clustering, any packet from a cluster member can reach a cluster head within k hops, and thus the transmission delay is bounded as Θ(1) for any finite k. We first characterize the critical transmission range for connectivity in mobile k-hop clustered networks where all nodes move under either the random walk mobility model with nontrivial velocity or the i.i.d. mobility model. By the term nontrivial velocity, we mean that the velocity of a node v is ω(r(n)), where r(n) is the transmission range of the node. We then compare with the critical transmission range for stationary k-hop clustered networks. In addition, the critical number of neighbors is studied in a parallel manner for both stationary and mobile networks. We also study the transmission power versus delay tradeoff and the average energy consumption per flow among different types of networks. We show that random walk mobility with nontrivial velocities increases connectivity in k-hop clustered networks, and thus significantly decreases the energy consumption and improves the power-delay tradeoff. The decrease of energy consumption per flow is shown to be Θ([(logn)/(nd)]) in clustered networks. These results provide insights on network design and fundamental guidelines on building a large-scale wireless network.]]> 21 2 440 454 3625 21 2 455 468 1851 21 2 469 481 2568 21 2 482 494 2706 21 2 495 508 3232 21 2 509 521 2274 21 2 522 535 3142 21 2 536 550 2694 21 2 551 565 2753 21 2 566 579 2960 21 2 580 593 2353 21 2 594 609 2539 r within each other, where r > 0 is the node transmission radius. The flooding time is the number of time-steps required to broadcast a message from a source node to every node of the network. Flooding time is an important measure of how fast information can spread in dynamic networks. We derive the first upper bound on the flooding time, which is a decreasing function of the maximal speed of the nodes. The bound holds with high probability, and it is nearly tight. Our bound shows that, thanks to node mobility, even when the network is sparse and disconnected, information spreading can be fast.]]> 21 2 610 620 2777 21 2 621 633 2818 21 2 634 647 3270 21 2 648 662 2788 21 2 663 677 2225 21 2 678 678 1637 21 2 679 679 1792 21 2 680 680 95 21 2 C3 C3 128