1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413
|
//
// gear.cc : GEAR Filter
// authors : Yan Yu and Fabio Silva
//
// Copyright (C) 2000-2003 by the University of Southern California
// Copyright (C) 2000-2003 by the University of California
// $Id: gear.cc,v 1.7 2011/10/02 22:32:34 tom_henderson Exp $
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License,
// version 2, as published by the Free Software Foundation.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program; if not, write to the Free Software Foundation, Inc.,
// 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
//
// Linking this file statically or dynamically with other modules is making
// a combined work based on this file. Thus, the terms and conditions of
// the GNU General Public License cover the whole combination.
//
// In addition, as a special exception, the copyright holders of this file
// give you permission to combine this file with free software programs or
// libraries that are released under the GNU LGPL and with code included in
// the standard release of ns-2 under the Apache 2.0 license or under
// otherwise-compatible licenses with advertising requirements (or modified
// versions of such code, with unchanged license). You may copy and
// distribute such a system following the terms of the GNU GPL for this
// file and the licenses of the other code concerned, provided that you
// include the source code of that other code when and as the GNU GPL
// requires distribution of source code.
//
// Note that people who make modified versions of this file are not
// obligated to grant this special exception for their modified versions;
// it is their choice whether to do so. The GNU General Public License
// gives permission to release a modified version without this exception;
// this exception also makes it possible to release a modified version
// which carries forward this exception.
#include "gear.hh"
#ifdef NS_DIFFUSION
static class GeoRoutingFilterClass : public TclClass {
public:
GeoRoutingFilterClass() : TclClass("Application/DiffApp/GeoRoutingFilter") {}
TclObject * create(int argc, const char*const* argv) {
if (argc == 5)
return (new GeoRoutingFilter(argv[4]));
else
fprintf(stderr, "Insufficient number of args for creating GeoRoutingFilter");
return (NULL);
}
} class_geo_routing_filter;
int GeoRoutingFilter::command(int argc, const char*const* argv) {
if (argc == 2) {
if (strcmp(argv[1], "start") == 0) {
run();
return TCL_OK;
}
}
return DiffApp::command(argc, argv);
}
#endif // NS_DIFFUSION
void GeoFilterReceive::recv(Message *msg, handle h)
{
app_->recv(msg, h);
}
int GeoMessageSendTimer::expire()
{
// Call timeout function
agent_->messageTimeout(msg_);
// Do not reschedule this timer
delete this;
return -1;
}
int GeoNeighborsTimer::expire()
{
// Call timeout function
agent_->neighborTimeout();
// Reschedule this timer
return 0;
}
int GeoBeaconRequestTimer::expire()
{
// Call the timeout function
agent_->beaconTimeout();
// Reschedule this timer
return 0;
}
void GeoRoutingFilter::beaconTimeout()
{
NRAttrVec attrs;
Message *beacon_msg;
struct timeval tv;
GetTime(&tv);
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Beacon Timeout !\n");
// We broadcast the request from time to time, in case a new
// neighbor joins in and never gets a chance to get its informaiton
if ((last_neighbor_request_tv_.tv_sec == 0) ||
((tv.tv_sec - last_neighbor_request_tv_.tv_sec) >=
GEO_NEIGHBOR_REQUEST_PERIOD)){
// Update timestamp
GetTime(&last_neighbor_request_tv_);
// Sends a beacon to all neighbors
attrs.push_back(GeoBeaconTypeAttr.make(NRAttribute::IS, GEO_REQUEST));
attrs.push_back(GeoLatitudeAttr.make(NRAttribute::IS, geo_latitude_));
attrs.push_back(GeoLongitudeAttr.make(NRAttribute::IS, geo_longitude_));
attrs.push_back(GeoRemainingEnergyAttr.make(NRAttribute::IS,
remainingEnergy()));
beacon_msg = new Message(DIFFUSION_VERSION, DATA, 0, 0,
attrs.size(), pkt_count_, rdm_id_,
BROADCAST_ADDR, LOCALHOST_ADDR);
// Don't forget to increment pkt_count
pkt_count_++;
beacon_msg->msg_attr_vec_ = CopyAttrs(&attrs);
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Sending Beacon Request...\n");
((DiffusionRouting *)dr_)->sendMessage(beacon_msg, post_filter_handle_);
ClearAttrs(&attrs);
delete beacon_msg;
}
}
void GeoRoutingFilter::neighborTimeout()
{
NeighborList::iterator neighbor_itr;
NeighborEntry *neighbor_entry;
struct timeval tv;
GetTime(&tv);
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Neighbors Timeout !\n");
neighbor_itr = neighbors_list_.begin();
while (neighbor_itr != neighbors_list_.end()){
neighbor_entry = *neighbor_itr;
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Check: %d: %d --> %d\n",
neighbor_entry->id_, neighbor_entry->tv_.tv_sec,
tv.tv_sec);
if ((tv.tv_sec - neighbor_entry->tv_.tv_sec) >= GEO_NEIGHBOR_EXPIRED){
// Delete timed-out neighbor
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Deleting neighbor %d\n",
neighbor_entry->id_);
neighbor_itr = neighbors_list_.erase(neighbor_itr);
delete neighbor_entry;
}
else{
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Neighbor %d, (%d,%d)\n",
neighbor_entry->id_, neighbor_entry->tv_.tv_sec,
neighbor_entry->tv_.tv_usec);
neighbor_itr++;
}
}
}
void GeoRoutingFilter::messageTimeout(Message *msg)
{
// Send message
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Message Timeout !\n");
((DiffusionRouting *)dr_)->sendMessage(msg, post_filter_handle_,
GEOROUTING_POST_FILTER_PRIORITY);
}
void GeoRoutingFilter::recv(Message *msg, handle h)
{
if (h == pre_filter_handle_){
preProcessFilter(msg);
return;
}
if (h == post_filter_handle_){
postProcessFilter(msg);
return;
}
DiffPrintWithTime(DEBUG_ALWAYS,
"Gear - Received message for an unknown handle %d !\n", h);
}
void GeoRoutingFilter::preProcessFilter(Message *msg)
{
NRSimpleAttribute<void *> *heuristic_value_attribute = NULL;
NRSimpleAttribute<int> *beacon_type_attribute = NULL;
NRSimpleAttribute<double> *beacon_info_attribute = NULL;
double neighbor_energy = 0.0;
double neighbor_longitude = 0.0;
double neighbor_latitude = 0.0;
double new_heuristic_value = 0.0;
int32_t neighbor_id;
int beacon_type;
struct timeval tv;
HeuristicValue *heuristic_value = NULL;
GeoLocation dst_location;
TimerCallback *beacon_timer = NULL;
NRAttrVec attrs;
Message *beacon_msg = NULL;
PktHeader *pkt_header = NULL;
switch (msg->msg_type_){
case INTEREST:
case EXPLORATORY_DATA:
case PUSH_EXPLORATORY_DATA:
if (msg->new_message_){
// Don't worry about old messages
// Pre-process the messages, extracting the geo-header attribute
// if it's present (or trying to create a new geo-header
// otherwise)
pkt_header = preProcessMessage(msg);
// If we have a packet header, add it to the message list
if (pkt_header){
sendNeighborRequest();
message_list_.push_back(pkt_header);
}
}
((DiffusionRouting *)dr_)->sendMessage(msg, pre_filter_handle_);
break;
case DATA:
// Look for a beacon type attribute in the data message
beacon_type_attribute = GeoBeaconTypeAttr.find(msg->msg_attr_vec_);
// If there is no beacon_type attribute, this is not a beacon data
// message. So, we just forward it to the next filter
if (!beacon_type_attribute){
((DiffusionRouting *)dr_)->sendMessage(msg, pre_filter_handle_);
break;
}
// Get neighbor id
neighbor_id = msg->last_hop_;
if ((neighbor_id == BROADCAST_ADDR) ||
(neighbor_id == LOCALHOST_ADDR)){
DiffPrintWithTime(DEBUG_ALWAYS, "Gear - Neighbor ID Invalid !\n");
return;
}
// Look for the rest of the information
beacon_type = beacon_type_attribute->getVal();
beacon_info_attribute = GeoLongitudeAttr.find(msg->msg_attr_vec_);
if (beacon_info_attribute){
neighbor_longitude = beacon_info_attribute->getVal();
}
beacon_info_attribute = GeoLatitudeAttr.find(msg->msg_attr_vec_);
if (beacon_info_attribute){
neighbor_latitude = beacon_info_attribute->getVal();
}
beacon_info_attribute = GeoRemainingEnergyAttr.find(msg->msg_attr_vec_);
if (beacon_info_attribute){
neighbor_energy = beacon_info_attribute->getVal();
}
// Update our neighbor list with the beacon's information
updateNeighbor(neighbor_id, neighbor_longitude,
neighbor_latitude, neighbor_energy);
// Get current time
GetTime(&tv);
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Beacon Information id: %d - location: %f,%f - energy: %f\n",
neighbor_id, neighbor_longitude,
neighbor_latitude, neighbor_energy);
if (beacon_type == GEO_REQUEST){
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Received a beacon request...\n");
// If we received a neighbor request, we have to generate a
// reply and send it after some random time. But this has to be
// suppresed if we have recently done it already
if (last_beacon_reply_tv_.tv_sec > 0){
// Send at most one neighbor beacon every
// GEO_BEACON_REPLY_PERIOD seconds
if ((tv.tv_sec - last_beacon_reply_tv_.tv_sec)
< GEO_BEACON_REPLY_PERIOD){
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Ignoring beacon request until %d.%06d!\n",
(tv.tv_sec + GEO_BEACON_REPLY_PERIOD), tv.tv_usec);
break;
}
}
// Create beacon reply message
attrs.push_back(GeoLongitudeAttr.make(NRAttribute::IS, geo_longitude_));
attrs.push_back(GeoLatitudeAttr.make(NRAttribute::IS, geo_latitude_));
attrs.push_back(GeoRemainingEnergyAttr.make(NRAttribute::IS,
remainingEnergy()));
attrs.push_back(GeoBeaconTypeAttr.make(NRAttribute::IS, GEO_REPLY));
// Let's try to extract the beacon's heuristic_value
heuristic_value_attribute = GeoHeuristicValueAttr.find(msg->msg_attr_vec_);
if (heuristic_value_attribute){
// Heuristic Value attribute found ! Include information about
// this destination if we have anything in our table
heuristic_value = (HeuristicValue *) heuristic_value_attribute->getVal();
dst_location.longitude_ = heuristic_value->dst_longitude_;
dst_location.latitude_ = heuristic_value->dst_latitude_;
// Retrieve heuristic_value
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Requesting h-value in (%lf,%lf)\n",
dst_location.longitude_, dst_location.latitude_);
new_heuristic_value = retrieveHeuristicValue(dst_location);
if (new_heuristic_value != INITIAL_HEURISTIC_VALUE){
// Add the heuristic_value to the message if we have any
// information about this particular destination
heuristic_value = new HeuristicValue(dst_location.longitude_,
dst_location.latitude_,
new_heuristic_value);
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Current h-value for (%lf,%lf):%lf\n",
dst_location.longitude_, dst_location.latitude_,
new_heuristic_value);
attrs.push_back(GeoHeuristicValueAttr.make(NRAttribute::IS,
(void *) heuristic_value,
sizeof(HeuristicValue)));
delete heuristic_value;
}
}
beacon_msg = new Message(DIFFUSION_VERSION, DATA, 0, 0, attrs.size(),
pkt_count_, rdm_id_, BROADCAST_ADDR,
LOCALHOST_ADDR);
// Don't forget to update pkt_count
pkt_count_++;
beacon_msg->msg_attr_vec_ = CopyAttrs(&attrs);
beacon_timer = new GeoMessageSendTimer(this, CopyMessage(beacon_msg));
((DiffusionRouting *)dr_)->addTimer(GEO_BEACON_REPLY_DELAY +
(int) ((GEO_BEACON_REPLY_JITTER *
(GetRand() * 1.0 / RAND_MAX) -
(GEO_BEACON_REPLY_JITTER / 2))),
beacon_timer);
ClearAttrs(&attrs);
delete beacon_msg;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Sending a beacon reply in response to request !\n");
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Local info: location: %f,%f - energy: %f\n",
geo_longitude_, geo_latitude_, remainingEnergy());
// Update beacon timestamp
GetTime(&last_beacon_reply_tv_);
}
else{
if (beacon_type == GEO_REPLY){
DiffPrintWithTime(DEBUG_IMPORTANT, "Gear - Received beacon reply\n");
}
else{
if (beacon_type == GEO_UPDATE){
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Received beacon update\n");
}
else{
DiffPrintWithTime(DEBUG_ALWAYS,
"Gear - Received unknown message !\n");
return;
}
}
// Extract the heuristic_value from the message
heuristic_value_attribute = GeoHeuristicValueAttr.find(msg->msg_attr_vec_);
if (heuristic_value_attribute){
heuristic_value = (HeuristicValue *) heuristic_value_attribute->getVal();
// Update learned cost value table
dst_location.longitude_ = heuristic_value->dst_longitude_;
dst_location.latitude_ = heuristic_value->dst_latitude_;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Received h-val update %d: (%lf,%lf):%f\n",
neighbor_id, dst_location.longitude_,
dst_location.latitude_,
heuristic_value->heuristic_value_);
learned_cost_table_.updateEntry(neighbor_id, dst_location,
heuristic_value->heuristic_value_);
}
}
break;
default:
// If we do not know about this message, we just pass it to the
// next filter
((DiffusionRouting *)dr_)->sendMessage(msg, pre_filter_handle_);
break;
}
}
void GeoRoutingFilter::postProcessFilter(Message *msg)
{
PktHeader *pkt_header = NULL;
GeoHeader *geo_header = NULL;
int action;
int32_t next_hop;
switch (msg->msg_type_){
case INTEREST:
case EXPLORATORY_DATA:
case PUSH_EXPLORATORY_DATA:
// Ignore messages with a local application as destination
if (msg->next_hop_ != LOCALHOST_ADDR){
// Retrieve packet header from previous stage
pkt_header = retrievePacketHeader(msg);
// If we have record of this packet, we restore the previous
// geo_header information before forwarding it further
if (pkt_header){
geo_header = restoreGeoHeader(pkt_header, msg);
// Increment path_len
geo_header->path_len_++;
// Check if we have to broadcast this message. We do not need
// to check if I have seen this broadcast packet before, since
// this is called by PostProcessFilter, so it must be a new
// packet. We only need to check if we are inside the target
// region
action = floodInsideRegion(geo_header);
// Add GeoHeader attribute to the message
msg->msg_attr_vec_->push_back(GeoHeaderAttr.make(NRAttribute::IS,
(void *) geo_header,
sizeof(GeoHeader)));
switch (action){
case BROADCAST:
// We are inside the region and have at least a neighbor
// which is inside the region too, so we just broadcast this
// message
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Broadcasting message: last_hop: %d!\n",
msg->last_hop_);
msg->next_hop_ = BROADCAST_ADDR;
((DiffusionRouting *)dr_)->sendMessage(msg, post_filter_handle_);
break;
case BROADCAST_SUPPRESS:
// We are either inside the region and have no neighbors
// also inside this region OR packet came from inside the
// region and we are outside the region. In either case, we
// do not forward the packet
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Suppressing broadcast !\n");
break;
case OUTSIDE_REGION:
// The packet is still outside the region. In order to route
// it to the region, we first try using a 'greedy mode'. If
// that doesn't work, we probably need to navigate around a
// hole
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Packet outside target region !\n");
next_hop = findNextHop(geo_header, true);
// If there are no neighbors, let's try to go around a hole
if (next_hop == BROADCAST_ADDR){
// Check if we should still be looking for a path
if (geo_header->path_len_ < MAX_PATH_LEN)
next_hop = findNextHop(geo_header, false);
}
// Still no neighbors, nothing we can do !
if (next_hop == BROADCAST_ADDR){
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Cannot find next hop !\n");
}
else{
// Forward message to next_hop
msg->next_hop_ = next_hop;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Forwarding message !\n");
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Next Hop: %d\n", next_hop);
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Last Hop: %d\n", msg->last_hop_);
((DiffusionRouting *)dr_)->sendMessage(msg, post_filter_handle_);
}
break;
default:
break;
}
// Let's not forget to delete both geo_header and pkt_header
delete pkt_header;
delete geo_header;
}
else{
// This message has no packet header information, so we just forward it
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Forwarding message without packet header info !\n");
((DiffusionRouting *)dr_)->sendMessage(msg, post_filter_handle_);
}
}
else{
// This is a message from gradient to a local app
DiffPrintWithTime(DEBUG_LOTS_DETAILS,
"Gear - Forwarding message to a local agent !\n");
((DiffusionRouting *)dr_)->sendMessage(msg, post_filter_handle_);
}
break;
default:
// All other messages are just forwarded without any changes
((DiffusionRouting *)dr_)->sendMessage(msg, post_filter_handle_);
break;
}
}
handle GeoRoutingFilter::setupPreFilter()
{
NRAttrVec attrs;
handle h;
// Set up a filter that matches every packet coming in
attrs.push_back(NRClassAttr.make(NRAttribute::IS,
NRAttribute::INTEREST_CLASS));
h = ((DiffusionRouting *)dr_)->addFilter(&attrs,
GEOROUTING_PRE_FILTER_PRIORITY,
filter_callback_);
ClearAttrs(&attrs);
return h;
}
handle GeoRoutingFilter::setupPostFilter()
{
NRAttrVec attrs;
handle h;
// This is a filter that matches all packets after processing by the
// gradient filter
attrs.push_back(NRClassAttr.make(NRAttribute::IS,
NRAttribute::INTEREST_CLASS));
h = ((DiffusionRouting *)dr_)->addFilter(&attrs,
GEOROUTING_POST_FILTER_PRIORITY,
filter_callback_);
ClearAttrs(&attrs);
return h;
}
void GeoRoutingFilter::run()
{
#ifdef NS_DIFFUSION
TimerCallback *neighbor_timer, *beacon_timer;
// Set up node location
DiffPrintWithTime(DEBUG_ALWAYS, "Initializing GEAR IN NS!\n");
getNodeLocation(&geo_longitude_, &geo_latitude_);
DiffPrintWithTime(DEBUG_ALWAYS, "Gear - Location %f,%f\n",
geo_longitude_, geo_latitude_);
// Set up filters
pre_filter_handle_ = setupPreFilter();
post_filter_handle_ = setupPostFilter();
// Add periodic neighbor checking timer
neighbor_timer = new GeoNeighborsTimer(this);
((DiffusionRouting *)dr_)->addTimer(GEO_NEIGHBOR_DELAY, neighbor_timer);
// Add periodic beacon request timer
beacon_timer = new GeoBeaconRequestTimer(this);
((DiffusionRouting *)dr_)->addTimer(GEO_BEACON_REQUEST_CHECK_PERIOD,
beacon_timer);
DiffPrintWithTime(DEBUG_ALWAYS, "Gear - Pre-filter: received handle %d !\n",
pre_filter_handle_);
DiffPrintWithTime(DEBUG_ALWAYS, "Gear - Post-filter: received handle %d !\n",
post_filter_handle_);
DiffPrintWithTime(DEBUG_ALWAYS, "Gear - Initialized !\n");
#endif // NS_DIFFUSION
// Sends a beacon request upon start-up
beaconTimeout();
#ifndef NS_DIFFUSION
// We don't do anything
while (1){
sleep(1000);
}
#endif // !NS_DIFFUSION
}
#ifdef NS_DIFFUSION
GeoRoutingFilter::GeoRoutingFilter(const char *diffrtg)
{
DiffAppAgent *agent;
#else
GeoRoutingFilter::GeoRoutingFilter(int argc, char **argv)
{
// Parse command line options
parseCommandLine(argc, argv);
#endif // NS_DIFFUSION
struct timeval tv;
// Initialize a few parameters
initial_energy_ = GEO_INITIAL_ENERGY;
unit_energy_for_send_ = GEO_UNIT_ENERGY_FOR_SEND;
unit_energy_for_recv_ = GEO_UNIT_ENERGY_FOR_RECV;
num_pkt_sent_ = 0;
num_pkt_recv_ = 0;
// Initialize beacon timestamp
last_beacon_reply_tv_.tv_sec = 0;
last_beacon_reply_tv_.tv_usec = 0;
last_neighbor_request_tv_.tv_sec = 0;
last_neighbor_request_tv_.tv_usec = 0;
#ifdef NS_DIFFUSION
agent = (DiffAppAgent *)TclObject::lookup(diffrtg);
dr_ = agent->dr();
#else
getNodeLocation(&geo_longitude_, &geo_latitude_);
DiffPrintWithTime(DEBUG_ALWAYS, "Gear - Location %f,%f\n",
geo_longitude_, geo_latitude_);
#endif // NS_DIFFUSION
GetTime(&tv);
SetSeed(&tv);
pkt_count_ = GetRand();
rdm_id_ = GetRand();
#ifndef NS_DIFFUSION
// Create Diffusion Routing class
dr_ = NR::createNR(diffusion_port_);
#endif // !NS_DIFFUSION
filter_callback_ = new GeoFilterReceive(this);
#ifndef NS_DIFFUSION
// Set up filters
pre_filter_handle_ = setupPreFilter();
post_filter_handle_ = setupPostFilter();
// Add periodic neighbor checking timer
neighbor_timer = new GeoNeighborsTimer(this);
((DiffusionRouting *)dr_)->addTimer(GEO_NEIGHBOR_DELAY, neighbor_timer);
// Add periodic beacon request timer
beacon_timer = new GeoBeaconRequestTimer(this);
((DiffusionRouting *)dr_)->addTimer(GEO_BEACON_REQUEST_CHECK_PERIOD,
beacon_timer);
DiffPrintWithTime(DEBUG_ALWAYS,
"Gear - Pre-filter received handle %d !\n",
pre_filter_handle_);
DiffPrintWithTime(DEBUG_ALWAYS,
"Gear - Post-filter received handle %d !\n",
post_filter_handle_);
DiffPrintWithTime(DEBUG_ALWAYS, "Gear - Initialized !\n");
#endif // !NS_DIFFUSION
}
void GeoRoutingFilter::getNodeLocation(double *longitude, double *latitude)
{
#ifdef NS_DIFFUSION
double z;
MobileNode *node = ((DiffusionRouting *)dr_)->getNode();
node->getLoc(longitude, latitude, &z);
#else
char *longitude_env, *latitude_env;
bool got_location = false;
#ifdef USE_EMSIM
char *sim_loc_env;
float my_longitude, my_latitude;
#endif // USE_EMSIM
longitude_env = getenv("gear_longitude");
latitude_env = getenv("gear_latitude");
if (longitude_env && latitude_env){
*longitude = atof(longitude_env);
*latitude = atof(latitude_env);
DiffPrintWithTime(DEBUG_ALWAYS,
"Gear - Using location from gear_longitude, gear_latitude\n");
got_location = true;
}
#ifdef USE_EMSIM
else{
// Try to get location from SIM_LOC (emsim environment variable)
sim_loc_env = getenv("SIM_LOC");
if (sim_loc_env){
if (sscanf(sim_loc_env, "%f %f", &my_longitude, &my_latitude) == 2){
DiffPrintWithTime(DEBUG_ALWAYS,
"Gear - Using location from SIM_LOC !\n");
*longitude = (double) my_longitude;
*latitude = (double) my_latitude;
got_location = true;
}
}
}
#endif // USE_EMSIM
// Check if we were successful getting the node location
if (!got_location){
DiffPrintWithTime(DEBUG_ALWAYS,
"Gear - Could not get the node location !\n");
exit(-1);
}
#endif // NS_DIFFUSION
}
bool GeoRoutingFilter::checkNeighbors()
{
NeighborList::iterator neighbor_itr;
NeighborEntry *neighbor_entry;
struct timeval tv;
GetTime(&tv);
for (neighbor_itr = neighbors_list_.begin();
neighbor_itr != neighbors_list_.end(); ++neighbor_itr){
neighbor_entry = *neighbor_itr;
if ((tv.tv_sec - neighbor_entry->tv_.tv_sec) >= GEO_NEIGHBOR_UPDATE)
return true;
}
return false;
}
void GeoRoutingFilter::sendNeighborRequest()
{
NRAttrVec attrs;
Message *beacon_msg;
TimerCallback *beacon_timer;
// Check if we need to send a beacon request to update our neighbor
// information
if (!checkNeighbors())
return;
// Yes ! Create the beacon message
attrs.push_back(GeoBeaconTypeAttr.make(NRAttribute::IS, GEO_REQUEST));
attrs.push_back(GeoLatitudeAttr.make(NRAttribute::IS, geo_latitude_));
attrs.push_back(GeoLongitudeAttr.make(NRAttribute::IS, geo_longitude_));
attrs.push_back(GeoRemainingEnergyAttr.make(NRAttribute::IS,
remainingEnergy()));
// Neighbor beacon msg is a DATA message
beacon_msg = new Message(DIFFUSION_VERSION, DATA, 0, 0,
attrs.size(), pkt_count_, rdm_id_,
BROADCAST_ADDR, LOCALHOST_ADDR);
// Don't forget to increment pkt_count
pkt_count_++;
beacon_msg->msg_attr_vec_ = CopyAttrs(&attrs);
// Generate a beacon request, add some random jitter before actually
// sending it
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Broadcasting neighbor info request...\n");
beacon_timer = new GeoMessageSendTimer(this, CopyMessage(beacon_msg));
((DiffusionRouting *)dr_)->addTimer(GEO_BEACON_DELAY +
(int) ((GEO_BEACON_JITTER *
(GetRand() * 1.0 / RAND_MAX) -
(GEO_BEACON_JITTER / 2))),
beacon_timer);
GetTime(&last_neighbor_request_tv_);
ClearAttrs(&attrs);
delete beacon_msg;
}
void GeoRoutingFilter::updateNeighbor(int32_t neighbor_id,
double neighbor_longitude,
double neighbor_latitude,
double neighbor_energy)
{
NeighborEntry *neighbor_entry;
// Look for this neighbor in our neighbor's list
neighbor_entry = findNeighbor(neighbor_id);
if (!neighbor_entry){
// Insert a new neighbor into our list
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Inserting new neighbor %d !\n", neighbor_id);
neighbor_entry = new NeighborEntry(neighbor_id, neighbor_longitude,
neighbor_latitude, neighbor_energy);
// Insert new element with key neighbor_id into the hash map
neighbors_list_.push_back(neighbor_entry);
}
else{
// Update an existing neighbor entry
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Updating neighbor %d !\n", neighbor_id);
neighbor_entry->longitude_ = neighbor_longitude;
neighbor_entry->latitude_ = neighbor_latitude;
neighbor_entry->remaining_energy_ = neighbor_energy;
GetTime(&(neighbor_entry->tv_));
}
}
PktHeader * GeoRoutingFilter::retrievePacketHeader(Message *msg)
{
PacketList::iterator packet_itr;
PktHeader *pkt_header = NULL;
for (packet_itr = message_list_.begin();
packet_itr != message_list_.end(); ++packet_itr){
pkt_header = *packet_itr;
if ((pkt_header->rdm_id_ == msg->rdm_id_) &&
(pkt_header->pkt_num_ == msg->pkt_num_)){
packet_itr = message_list_.erase(packet_itr);
return pkt_header;
}
}
// Entry not found in our list
return NULL;
}
PktHeader * GeoRoutingFilter::preProcessMessage(Message *msg)
{
float longitude_min, longitude_max;
float latitude_min, latitude_max;
PktHeader *pkt_header = NULL;
pkt_header = stripOutHeader(msg);
if (!pkt_header){
// This is a message either coming from a local application (for
// which a geo_header hasn't been extracted yet) or a message with
// no geographic information (in which case there's nothing we can
// do about). We first try to extract geographic information from
// the message in order to create a new geo_header
if (extractLocation(msg, &longitude_min, &longitude_max,
&latitude_min, &latitude_max)){
// Create new Packet Header
pkt_header = new PktHeader;
// Fill in the new packet header
pkt_header->pkt_num_ = msg->pkt_num_;
pkt_header->rdm_id_ = msg->rdm_id_;
pkt_header->prev_hop_ = msg->last_hop_;
pkt_header->pkt_type_ = UNICAST_ORIGINAL;
pkt_header->path_len_ = 0;
pkt_header->dst_region_.center_.longitude_ = (longitude_min +
longitude_max) / 2;
pkt_header->dst_region_.center_.latitude_ = (latitude_min +
latitude_max) / 2;
pkt_header->dst_region_.radius_ = Distance(longitude_min, latitude_min,
longitude_max,
latitude_max) / 2;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - ExtractLocation %f,%f, %f,%f (%f,%f)\n",
longitude_min, longitude_max,
latitude_min, latitude_max,
pkt_header->dst_region_.center_.longitude_,
pkt_header->dst_region_.center_.latitude_);
}
}
return pkt_header;
}
PktHeader * GeoRoutingFilter::stripOutHeader(Message *msg)
{
NRSimpleAttribute<void *> *geo_header_attribute;
GeoHeader *geo_header;
PktHeader *pkt_header = NULL;
geo_header_attribute = GeoHeaderAttr.find(msg->msg_attr_vec_);
if (geo_header_attribute){
geo_header = (GeoHeader *)(geo_header_attribute->getVal());
// Create Packet Header structure
pkt_header = new PktHeader;
pkt_header->pkt_num_ = msg->pkt_num_;
pkt_header->rdm_id_ = msg->rdm_id_;
pkt_header->prev_hop_ = msg->last_hop_;
// Copy the msg from Geo_header to PktHeader
pkt_header->pkt_type_ = geo_header->pkt_type_;
pkt_header->dst_region_.center_.longitude_ = geo_header->dst_region_.center_.longitude_;
pkt_header->dst_region_.center_.latitude_ = geo_header->dst_region_.center_.latitude_;
pkt_header->dst_region_.radius_ = geo_header->dst_region_.radius_;
pkt_header->path_len_ = geo_header->path_len_;
takeOutAttr(msg->msg_attr_vec_, GEO_HEADER_KEY);
delete geo_header_attribute;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Got GeoHeader last hop: %d, pkt (%d, %d) !\n",
msg->last_hop_, msg->pkt_num_, msg->rdm_id_);
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Type: %d, Region: (%f,%f):%f, Path: %d !\n",
pkt_header->pkt_type_,
pkt_header->dst_region_.center_.longitude_,
pkt_header->dst_region_.center_.latitude_,
pkt_header->dst_region_.radius_,
pkt_header->path_len_);
}
else{
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - GeoHeader Attribute not present !\n");
}
return pkt_header;
}
void GeoRoutingFilter::takeOutAttr(NRAttrVec *attrs, int32_t key)
{
NRAttrVec::iterator attr_itr;
for (attr_itr = attrs->begin(); attr_itr != attrs->end(); ++attr_itr){
if ((*attr_itr)->getKey() == key){
break;
}
}
if (attr_itr != attrs->end())
attrs->erase(attr_itr);
}
bool GeoRoutingFilter::extractLocation(Message *msg,
float *longitude_min,
float *longitude_max,
float *latitude_min,
float *latitude_max)
{
NRSimpleAttribute<float> *lat_attr;
NRSimpleAttribute<float> *long_attr;
NRAttrVec::iterator itr;
NRAttrVec *attrs;
bool has_long_min = false;
bool has_long_max = false;
bool has_lat_min = false;
bool has_lat_max = false;
attrs = msg->msg_attr_vec_;
// Extracts longitude coordinates for the target point/region from
// this message
itr = attrs->begin();
for (;;){
long_attr = LongitudeAttr.find_from(attrs, itr, &itr);
if (!long_attr){
if (has_long_min && has_long_max)
break;
else
return false;
}
if ((long_attr->getOp() == NRAttribute::GT) ||
(long_attr->getOp() == NRAttribute::GE)){
// Check for double set of coordinates
if (has_long_min)
return false;
has_long_min = true;
*longitude_min = long_attr->getVal();
}
if ((long_attr->getOp() == NRAttribute::LT) ||
(long_attr->getOp() == NRAttribute::LE)){
// Check for double set of coordinates
if (has_long_max)
return false;
has_long_max = true;
*longitude_max = long_attr->getVal();
}
if (long_attr->getOp() == NRAttribute::EQ){
// Check for double set of coordinates
if (has_long_min || has_long_max)
return false;
has_long_min = true;
has_long_max = true;
*longitude_min = long_attr->getVal();
*longitude_max = *longitude_min;
}
// Increment itr to avoid an infinite loop
itr++;
}
// Now we extract latitude coordinates of the target region from the
// message
itr = attrs->begin();
for (;;){
lat_attr = LatitudeAttr.find_from(attrs, itr, &itr);
if (!lat_attr){
if (has_lat_min && has_lat_max)
break;
else
return false;
}
if ((lat_attr->getOp() == NRAttribute::GT) ||
(lat_attr->getOp() == NRAttribute::GE)){
// Check for double set of coordinates
if (has_lat_min)
return false;
has_lat_min = true;
*latitude_min = lat_attr->getVal();
}
if ((lat_attr->getOp() == NRAttribute::LT) ||
(lat_attr->getOp() == NRAttribute::LE)){
// Check for double set of coordinates
if (has_lat_max)
return false;
has_lat_max = true;
*latitude_max = lat_attr->getVal();
}
if (lat_attr->getOp() == NRAttribute::EQ){
// Check for double set of coordinates
if (has_lat_min || has_lat_max)
return false;
has_lat_min = true;
has_lat_max = true;
*latitude_min = lat_attr->getVal();
*latitude_max = *latitude_min;
}
// Increment itr to avoid an infinite loop
itr++;
}
if (has_long_min && has_long_max && has_lat_min && has_lat_min)
return true;
return false;
}
GeoHeader * GeoRoutingFilter::restoreGeoHeader(PktHeader *pkt_header, Message *msg)
{
GeoHeader *geo_header;
geo_header = new GeoHeader;
msg->last_hop_ = pkt_header->prev_hop_;
geo_header->pkt_type_ = pkt_header->pkt_type_;
geo_header->dst_region_.center_.longitude_ = pkt_header->dst_region_.center_.longitude_;
geo_header->dst_region_.center_.latitude_ = pkt_header->dst_region_.center_.latitude_;
geo_header->dst_region_.radius_ = pkt_header->dst_region_.radius_;
geo_header->path_len_ = pkt_header->path_len_;
return geo_header;
}
int32_t GeoRoutingFilter::findNextHop(GeoHeader *geo_header, bool greedy)
{
NeighborList::iterator neighbor_itr;
NeighborEntry *neighbor_entry;
GeoLocation destination, min_neighbor_location;
double current_learned_cost, min_learned_cost;
double current_distance;
double distance, gap;
int32_t min_cost_id, neighbor_id;
int num_neighbors;
double new_heuristic_value;
// Load the destination coordinate from the packet
destination = geo_header->dst_region_.center_;
current_distance = Distance(geo_longitude_, geo_latitude_,
destination.longitude_, destination.latitude_);
min_learned_cost = MAX_INT;
num_neighbors = 0;
// this is really to quiet the compiler.
min_neighbor_location.longitude_ = 0;
min_neighbor_location.latitude_ = 0;
min_cost_id = 0;
// Now we go through out list of neighbor and compute the cost to
// each one
for (neighbor_itr = neighbors_list_.begin();
neighbor_itr != neighbors_list_.end(); ++neighbor_itr){
neighbor_entry = *neighbor_itr;
num_neighbors++;
neighbor_id = neighbor_entry->id_;
current_learned_cost = retrieveLearnedCost(neighbor_id, destination);
// Calculate distance from this neighbor to dst
distance = Distance(neighbor_entry->longitude_, neighbor_entry->latitude_,
destination.longitude_, destination.latitude_);
// If we are in 'greedy mode', we do not want to move away, so we
// skip neighbors that are farther away than us from the region
if (greedy && (distance > current_distance))
continue;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Neighbor: %d: cost = %f, min_cost = %f\n",
neighbor_id, current_learned_cost, min_learned_cost);
// Found a neighbor with a lower cost
if (current_learned_cost < min_learned_cost){
min_learned_cost = current_learned_cost;
min_cost_id = neighbor_entry->id_;
min_neighbor_location.longitude_ = neighbor_entry->longitude_;
min_neighbor_location.latitude_ = neighbor_entry->latitude_;
}
}
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - # neighbors: %d; cur: %f,%f, dst: %f,%f\n",
num_neighbors, geo_longitude_, geo_latitude_,
destination.longitude_, destination.latitude_);
// Check if we have neighbors we can use to forward this message
if (min_learned_cost < MAX_INT){
// Calculate the cost from me to my next hop neighbor
gap = Distance(min_neighbor_location.longitude_,
min_neighbor_location.latitude_,
geo_longitude_, geo_latitude_);
// Update my heuristic_value
new_heuristic_value = min_learned_cost + gap;
// Broadcast the new heuristic value if it's changed significantly
if (h_value_table_.updateEntry(destination, new_heuristic_value))
broadcastHeuristicValue(destination, new_heuristic_value);
// Return neighbor this message should go
return min_cost_id;
}
// We have no neighbors to whom we can forward this message !
return BROADCAST_ADDR;
}
void GeoRoutingFilter::broadcastHeuristicValue(GeoLocation dst,
double new_heuristic_value)
{
NRAttrVec attrs;
HeuristicValue *heuristic_value;
Message *beacon_msg;
TimerCallback *beacon_timer;
attrs.push_back(GeoLongitudeAttr.make(NRAttribute::IS, geo_longitude_));
attrs.push_back(GeoLatitudeAttr.make(NRAttribute::IS, geo_latitude_));
attrs.push_back(GeoRemainingEnergyAttr.make(NRAttribute::IS,
remainingEnergy()));
attrs.push_back(GeoBeaconTypeAttr.make(NRAttribute::IS, GEO_UPDATE));
heuristic_value = new HeuristicValue(dst.longitude_,
dst.latitude_, new_heuristic_value);
attrs.push_back(GeoHeuristicValueAttr.make(NRAttribute::IS,
(void *) heuristic_value,
sizeof(HeuristicValue)));
beacon_msg = new Message(DIFFUSION_VERSION, DATA, 0, 0,
attrs.size(), pkt_count_, rdm_id_,
BROADCAST_ADDR, LOCALHOST_ADDR);
// Don't forget to increase pkt_count
pkt_count_++;
beacon_msg->msg_attr_vec_ = CopyAttrs(&attrs);
// Now, we generate a beacon to broadcast triggered h-value update
// but first we add some random jitter before actually sending it
beacon_timer = new GeoMessageSendTimer(this, CopyMessage(beacon_msg));
((DiffusionRouting *)dr_)->addTimer(GEO_BEACON_DELAY +
(int) ((GEO_BEACON_JITTER *
(GetRand() * 1.0 / RAND_MAX) -
(GEO_BEACON_JITTER / 2))),
beacon_timer);
// Delete everything we created here
ClearAttrs(&attrs);
delete beacon_msg;
delete heuristic_value;
}
int GeoRoutingFilter::floodInsideRegion(GeoHeader *geo_header)
{
NeighborList::iterator neighbor_itr;
NeighborEntry *neighbor_entry;
GeoLocation destination;
double radius, distance;
// Load destination coordinates
destination = geo_header->dst_region_.center_;
radius = geo_header->dst_region_.radius_;
if (Distance(geo_longitude_, geo_latitude_,
destination.longitude_, destination.latitude_) <= radius){
// We are inside the target region, change mode to BROADCAST
geo_header->pkt_type_ = BROADCAST_TYPE;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Packet inside target region !\n");
// If all my neighbors are outside this region, suppress this
// broadcast message
for (neighbor_itr = neighbors_list_.begin();
neighbor_itr != neighbors_list_.end(); ++neighbor_itr){
neighbor_entry = *neighbor_itr;
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Neighbor %d, %lf,%lf !\n",
neighbor_entry->id_,
neighbor_entry->longitude_, neighbor_entry->latitude_);
// Calculate distance between neighbor and dst
distance = Distance(neighbor_entry->longitude_,
neighbor_entry->latitude_,
destination.longitude_, destination.latitude_);
// As long as we have one neighbor inside the region, broadcast
// the message
if (distance < radius)
return BROADCAST;
}
return BROADCAST_SUPPRESS;
}
else{
if (geo_header->pkt_type_ == BROADCAST_TYPE){
// This is a BROADCAST packet flooded outside the region
return BROADCAST_SUPPRESS;
}
else{
// We are still outside the target region, continue forwading
// the packet towards the region
return OUTSIDE_REGION;
}
}
}
double GeoRoutingFilter::retrieveLearnedCost(int neighbor_id, GeoLocation dst)
{
int index;
index = learned_cost_table_.retrieveEntry(neighbor_id, &dst);
if (index != FAIL)
return learned_cost_table_.table_[index].learned_cost_value_;
else
return estimateCost(neighbor_id, dst);
}
double GeoRoutingFilter::estimateCost(int neighbor_id, GeoLocation dst)
{
NeighborEntry *neighbor_entry;
double distance;
// To get this neighbor's location, we first find the entry with neighbor_id
// Since right now it is pure geographical routing, the estimated cost is
// just the distance between neighbor_id to dst.
if (neighbor_id < 0){
DiffPrintWithTime(DEBUG_IMPORTANT,
"Gear - Invalid neighbor id: %d !\n", neighbor_id);
return FAIL;
}
neighbor_entry = findNeighbor(neighbor_id);
if (!neighbor_entry)
return FAIL;
distance = Distance(neighbor_entry->longitude_, neighbor_entry->latitude_,
dst.longitude_, dst.latitude_);
return distance;
}
NeighborEntry * GeoRoutingFilter::findNeighbor(int32_t neighbor_id)
{
NeighborList::iterator neighbor_itr;
NeighborEntry *neighbor_entry;
for (neighbor_itr = neighbors_list_.begin();
neighbor_itr != neighbors_list_.end(); ++neighbor_itr){
neighbor_entry = *neighbor_itr;
if (neighbor_entry->id_ == neighbor_id)
return neighbor_entry;
}
return NULL;
}
double GeoRoutingFilter::retrieveHeuristicValue(GeoLocation dst)
{
int index;
index = h_value_table_.retrieveEntry(&dst);
if (index != FAIL)
return h_value_table_.table_[index].heuristic_value_;
return INITIAL_HEURISTIC_VALUE;
}
#ifndef USE_SINGLE_ADDRESS_SPACE
int main(int argc, char **argv)
{
GeoRoutingFilter *geo_filter;
geo_filter = new GeoRoutingFilter(argc, argv);
geo_filter->run();
return 0;
}
#endif // !USE_SINGLE_ADDRESS_SPACE
|